#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;

long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  while (b) {
    swap(a, b);
    b %= a;
  }
  return a;
}

void expand_factors(long long n, set<long long>& out) {
  if (out.find(n) == out.end()) {
    out.insert(n);
    for (long long i = 2; i * i <= n; i++) {
      if (n % i == 0) {
        expand_factors(i, out);
        expand_factors(n / i, out);
      }
    }
  }
}

int solve(long long K, vector<long long>& A) {
  // A_divs: set of gcd(An, K)
  set<long long> A_divs;
  for (int i = 0; i < A.size(); i++) {
    A_divs.insert(gcd(A[i], K));
  }

  // factors: all factors of K
  set<long long> factors;
  factors.insert(1);
  expand_factors(K, factors);

  // toremove: all factors of A-divs
  set<long long> toremve;
  toremve.insert(1);
  for (set<long long>::iterator it = A_divs.begin(); it != A_divs.end(); it++) {
    expand_factors(*it, toremve);
  }

  return factors.size() - toremve.size();
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  // read input data
  int N;
  long long K;
  cin >> N >> K;
  vector<long long> A(N);
  for (int i = 0; i < N; i++) {
    cin >> A[i];
  }

  // solve and print answer
  int ans = solve(K, A);
  cout << ans << endl;
}