#include <bits/stdc++.h>
using namespace std;
const int N = 3e5+10, X = 1e6+10;
int a[N], f[X];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
int cnt = 0;
for(int i = 1; i <= n; ++i){
cin >> a[i];
if(a[i] <= k) cnt++;
f[a[i]]++;
}
for(int i = 1; i <= n; ++i){
if(a[i] == k){
cout << n-cnt << ' ';
continue;
}
int x = a[i];
int ans = (a[i]-k > sqrt(x) ? f[(a[i]-k)] : 0);
for(int j = 1; j <= sqrt(x); ++j){
if(x%j != k) continue;
ans += f[j];
if(a[i] == j) ans--;
ans += f[x/j];
if(a[i] == x/j) ans--;
}
cout << ans << ' ';
}
}
