#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll n, p, x, ans[5010], vis[5010], a[5010], v[5010], len, m[210] = {1};
#define pi pair<ll, ll>
#define pii pair<ll, p>
#define fi first
#define se second
pi t[5010];
char s[210];
priority_queue<pi, vector<pi>, greater<pi>> q;
void debug(ll a[] = ans){
	//system("cls");
	for(int i = 0 ; i < p ; i++)
		cout << a[i] << " \n"[i == p - 1];
}
signed main()
{
	memset(ans, 0x3f, sizeof ans);
    scanf("%lld%lld", &n, &p);
    for(int i = 1 ; i <= 200 ; i++)
    	m[i] = m[i - 1] * 10 % p;
    for(int i = 1 ; i <= n ; i++){
    	scanf("%s", s);
    	a[i] = (len = strlen(s));
    	for(int t = 0 ; t < len ; t++){
    		v[i] = (v[i] * 10ll + (s[t] - '0')) % p;
		}
    	//cout << a[i] << " " << v[i] << "\n";
		t[i] = {a[i], v[i]};
	}
	//sort(t + 1, t + n + 1);
	for(int i = 1 ; i <= n ; i++){
		q.push({t[i].fi, t[i].se});
		ans[t[i].se] = min(ans[t[i].se], t[i].fi);
	}
	int cnt = 0;
	while(q.size() && cnt < p){
		pi u = q.top();
		q.pop();
		if(vis[u.se])
			continue;
		vis[u.se] = true;
		cnt++;
		//debug(); cout << "-" << u.fi << " " << u.se << "\n";
		ans[u.se] = min(ans[u.se], u.fi);
		for(int i = 1 ; i <= n ; i++){
			if(ans[(u.se * m[a[i]] + v[i]) % p] >= u.fi + a[i])
				q.push({u.fi + a[i], (u.se * m[a[i]] + v[i]) % p}), ans[(u.se * m[a[i]] + v[i]) % p] = u.fi + a[i];
		}
	}
	for(int i = 0 ; i < p ; i++)
		printf("%d\n", ans[(p - i) % p] == ans[p] ? -1 : ans[(p - i) % p]);
    exit(0);
}