#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef array<int, 3> ai3;
const int inf = 0x3f3f3f3f;
const int Mod = 1e9 + 7;
const int inv2 = (Mod+1) / 2;
inline int sign(int a){ return (a&1) ? (Mod-1) : 1; }
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, int p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 111;
int fact[fN], invfact[fN], pw2[fN], invpw2[fN];
void initfact(int n){
	pw2[0] = 1; for(int i = 1; i <= n; ++i) pw2[i] = mul(pw2[i-1], 2);
	invpw2[0] = 1; for(int i = 1; i <= n; ++i) invpw2[i] = mul(invpw2[i-1], (Mod+1) / 2);
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
}
int binom(int n, int m){ return (m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])); }
const double pi = acos(-1);
inline void chmax(int &a, int b){ (b>a) ? (a=b) : 0; }
inline void chmin(int &a, int b){ (b<a) ? (a=b) : 0; }

int n, p;
int pw10[222];
int dis[5050], done[5050];
int val[5050], len[5050];

int main(){
	//freopen("ex_heart5.in", "r", stdin);
	//freopen("heart.out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> p;
	pw10[0] = 1; rep(i, 202) pw10[i+1] = pw10[i] * 10 % p;

	memset(dis, 0x3f, sizeof(dis));
	rep(i, n){
		string s;
		cin >> s;
		int v = 0, l = (int)s.size();
		rep(j, l) v = (v * 10 + s[j] - '0') % p;
		val[i] = v, len[i] = l;
		dis[v] = min(dis[v], l);
		//cout << i << ": " << val[i] << " " << len[i] << "\n";
	}

	rep(cc, 5005){
		int u = -1;
		rep(i, p) if(!done[i] && (u < 0 || dis[i] < dis[u])) u = i;
		if(u < 0) break;
		done[u] = 1;
		rep(i, n) chmin(dis[(u * pw10[len[i]] + val[i]) % p], dis[u] + len[i]);
	}

	rep(k, p){
		int id = (p - k) % p;
		cout << ((dis[id] >= inf) ? -1 : dis[id]) << "\n";
	}

	return 0;
}