#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define inf 0x3f3f3f3f3f3f3f3f
int n,p,l[5005],a[5005],dis[5001],pw[10005],minn;
bool vis[5001];
char s[205];
priority_queue<pii,vector<pii>,greater<pii>>q;
void dijkstra(){
    while(q.size()){
        int u=q.top().second;
        q.pop();
        if(vis[u])continue;
        vis[u]=true;
        for(int i=1;i<=n;i++){
            int v=(u*pw[l[i]]+a[i])%p,w=l[i];
            if(dis[u]+w<dis[v])
                q.push({dis[v]=dis[u]+w,v});
        }
    }
}
signed main(){
    scanf("%lld%lld",&n,&p),pw[0]=1;
    for(int i=1;i<=2*p;i++)
        pw[i]=pw[i-1]*10%p;
    memset(dis,0x3f,sizeof(dis));
    for(int i=1;i<=n;i++){
        scanf("%s",s+1);
        l[i]=strlen(s+1);
        for(int j=1;j<=l[i];j++)
            a[i]=((a[i]<<1)+(a[i]<<3)+(s[j]^48))%p;
        q.push({dis[a[i]]=min(dis[a[i]],l[i]),a[i]});
    }
    dijkstra();
    for(int i=0;i<p;i++){
        minn=dis[(p-i)%p];
        printf("%lld\n",(minn==inf?-1:minn));
    }
    return 0;
}