#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b, a%b);
}

int consistency1(int n, int k){

    unordered_map<int,int> mp;
    long long ans = 0;
    for(int i=0; i<n; i++){
        int target = k/gcd(k,a[i]);
        if(mp.count(target)){
            ans += mp[target];
        }
        //* Update map with divisors/factors of a[i]
        int x = a[i];
        for(int j=1; j*j<=x; j++){
            if(x%j != 0) continue;
            mp[j]++;
            if(j != x/j) mp[x/j]++;
        }
    }
    
    return ans;
}





int consistency2(int n, int k){

    unordered_map<int,int> gcdMp;
    
    long long ans = 0;
    
    for(int i=0; i<n; i++){
        int x = gcd(k,a[i]);
        
        for(auto& t : gcdMp){
        	int y = t.first;
        	int ct = t.second;
        	
        	if((x*y)%k == 0) ans += ct;
        }
        gcdMp[x]++;
    }
    
    return ans;
}













int practice(int n, int k){


    return 0;
}





void solve() {
    
    int n, k;
    cin>> n >> k;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency1(n, k) << " " << consistency2(n, k) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}