#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 1e6 + 5;
#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
#define OPEN freopen(".in", "r", stdin); \
freopen(".out", "w", stdout);
#else
#define OPEN void(23);
#endif
int sieve[MAXN];
int cnts[MAXN];
void solve()
{
int n, k; cin >> n >> k;
vector <int> vec(n);
for(int &i : vec) cin >> i, cnts[i]++;
for(int i = k +1; i < MAXN; i++)
{
for(int j = 0; j + k < MAXN; j += i)
sieve[j + k] += cnts[i];
}
for(int &i : vec) cout << sieve[i] << " ";
return;
}
int32_t main()
{
OPEN;
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int t = 1; //cin >> t;
while(t--)
{
solve();
}
}