#include <bits/stdc++.h>
#define PB push_back
#define EB emplace_back
using namespace std;
const int maxn = 5000, maxl = 200;
char str[maxl + 5];
int pw10[maxl + 5];
int len[maxn + 5], V[maxn + 5];
struct edge {
	int v, w;
	bool operator<(const edge& b) const { return w > b.w; }
};
vector<edge> g[maxn + 5];
int dis[maxn + 5];
bool vis[maxn + 5];
void dijkstra(int s) {
	priority_queue<edge> q;
	memset(dis, 127, sizeof(dis));
	dis[s] = 0, q.push({s, 0});
	while (!q.empty()) {
		int u = q.top().v; q.pop();
		if (vis[u]) continue;
		vis[u] = 1;
		for (const auto& e : g[u])
			if (dis[e.v] > dis[u] + e.w) {
				dis[e.v] = dis[u] + e.w;
				q.push((edge){e.v, dis[e.v]});
			}
	}
}
int main() {
	int n, p;
	scanf("%d%d", &n, &p);
	pw10[0] = 1;
	for (int i = 1; i <= maxl; i++) pw10[i] = 10 * pw10[i - 1] % p;
	for (int i = 1; i <= n; i++) {
		scanf("%s", str + 1);
		len[i] = strlen(str + 1);
		for (int j = 1; j <= len[i]; j++) V[i] = (V[i] * 10 + str[j] - '0') % p;
	}
	for (int i = 0; i < p; i++)
		for (int j = 1; j <= n; j++) g[i].PB({(i * pw10[len[j]] + V[j]) % p, len[j]});
	dijkstra(0);
	int d0 = 1E9;
	for (int i = 0; i < p; i++)
		for (const auto& e : g[i])
			if (!e.v) d0 = min(d0, dis[i] + e.w);
	printf("%d\n", d0 >= 1E9 ? -1 : d0);
	for (int i = p - 1; i; i--) printf("%d\n", dis[i] >= 1E9 ? -1 : dis[i]);
}