#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#define endl '\n'
int main()
{
cin.tie(0) -> sync_with_stdio(0);
int n, k;
cin >> n >> k;
int prime[1000005]={};
int a[n], cnt=0;
for(auto& i : a) {cin >> i;prime[i]=1;cnt+=(i>k);}
for(int i = 2;i <= n;i++) {
for(int j=i+i;j<=n;j+=i) prime[j]+=prime[j-i];
}
for(int i = 1;i <= n;i++) {
if(a[i]<=k) cout << cnt << endl;
else cout << prime[a[i]-k] << endl;
}
}