#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e9
#define mod 998244353
#define sz(x) (int)((x).size())
//#define int ll
//#define N
using namespace std;
const int N=5005;
int n,m;
int f[N][N],ans[N],vis[N];
void BellaKira()
{
    cin>>n>>m;
    for (int i=0;i<m;i++) ans[i]=inf;
    for (int i=0;i<m;i++)
    {
        for (int j=0;j<m;j++)
            f[i][j]=inf;
        f[i][i]=0;
    }
    for (int i=1;i<=n;i++)
    {
        string st;
        cin>>st;
        int x,y;
        y=1;
        x=0;
        for (auto u:st) x=(x*10+u-'0')%m,y=(y*10)%m;
        ans[x]=min(ans[x],sz(st));
        for (int j=0;j<m;j++)
        {
            int val=(j*y+x)%m;
            f[j][val]=min(f[j][val],sz(st));
        }
    }
    // return;
    while (1)
    {
        int s=-1;
        for (int i=0;i<m;i++)
            if (!vis[i])
            {
                if (s==-1||ans[i]<ans[s]) s=i;
            }
        if (s==-1) break;
        // cout<<s<<endl;
        vis[s]=1;
        for (int i=0;i<m;i++)
            ans[i]=min(ans[i],ans[s]+f[s][i]);
    }
    for (int i=0;i<m;i++)
        if (ans[(m-i)%m]>=1e9) cout<<-1<<'\n';
        else cout<<ans[(m-i)%m]<<'\n';
}
signed main()
{
    IOS;
    cin.tie(0);
    int T=1;
    while (T--)
    {
        BellaKira();
    }
}