#pragma GCC optimize("unroll-loops,Ofast,O3")
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define spc << " " <<
#define all(x) x.begin(), x.end()
#define ll long long
#define int long long
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define st first
#define nd second
#define inf 1000000009
#define MOD 1000000007
using namespace std;
void solve(){
int n, k; cin >> n >> k;
int arr[n+1];
map<int, int> num;
map<int, int> ans;
int maxi=0;
for(int i=1; i<=n; i++){
cin >> arr[i];
num[arr[i]]++;
if(arr[i]>maxi) maxi=arr[i];
}
for(auto p:num){
for(auto q:num){
if(p.st%q.st==k) ans[p.st]+=q.nd;
}
}
for(int i=1; i<=n; i++) cout << ans[arr[i]] << " ";
}
signed main(){
ios_base::sync_with_stdio(false);cin.tie(0);
#ifdef Local
freopen("in.txt","r",stdin);
freopen("out","w",stdout);
#endif
ll t=1;
//cin >> t;
while(t--) solve();
}
