/*
[templates]: 
duipai
spjdp
compre
addhis
floor_sum
treedfs
matrix
network_flow
polynomial
lca
bitset
valuesgt
fenwick
erbitree
*/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#include<bits/stdc++.h>
using namespace std;
// #define int long long
//use ll instead of int.
#define f(i, a, b) for(int i = (a); i <= (b); i++)
#define cl(i, n) i.clear(),i.resize(n);
#define endl '\n'
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e9;
//#define cerr if(false)cerr
//#define freopen if(false)freopen
mt19937 rng(time(0)); 
int rnd(int l, int r) {return rng() % (r-l+1) + l; }
#define watch(x) cerr  << (#x) << ' '<<'i'<<'s'<<' ' << x << endl
void pofe(int number, int bitnum) {
    string s; f(i, 0, bitnum) {s += char(number & 1) + '0'; number >>= 1; } 
    reverse(s.begin(), s.end()); cerr << s << endl; 
    return;
}
template <typename TYP> void cmax(TYP &x, TYP y) {if(x < y) x = y;}
template <typename TYP> void cmin(TYP &x, TYP y) {if(x > y) x = y;}
//调不出来给我对拍！
//use std::array.
const int N = 5000; 
int a[N + 10][220], len[N + 10], pw[220]; bool vis[N + 10]; 
int w[N + 10][N + 10]; int dis[N + 10], ans; 
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    //freopen();
    //freopen();
    //time_t start = clock();
    //think twice,code once.
    //think once,debug forever.
    int n, p; cin >> n >> p; 
    pw[0] = 1; 
    f(i, 1, 200) pw[i] = pw[i - 1] * 10 % p;  
    f(i, 0, p - 1) f(j, 0, p - 1) w[i][j] = inf; 
    f(i, 1, n) {
        string s; cin >> s;
        len[i] = s.size(); 
        int cnt = 0, cur = 0; 
        for(char ch : s) {
            a[i][len[i] - ++cnt] = ch - '0'; 
            cur = (cur * 10 + a[i][len[i] - cnt]) % p; 
        }
        // cerr << 0 << " " << cur << " " << len[i] << endl; 
        cmin(w[0][cur], len[i]); 
        f(j, 1, p - 1) {
            cur += pw[len[i]]; 
            cur %= p; 
            // cerr << j << " " << cur << " " << len[i] << endl; 
            cmin(w[j][cur], len[i]); 
        }
    } 
    f(i, 1, p - 1) dis[i] = inf; 
    int now = 0; ans = inf; 
    f(tt, 1, p) {
        vis[now] = 1; 
        int tmp = 0, mx = inf; 
        f(i, 0, p - 1) {
            int iw = w[now][i]; 
            if(i == 0) cmin(ans, dis[now] + iw); 
            else if(!vis[i]) {
                cmin(dis[i], dis[now] + iw);
                if(dis[i] < mx) {
                    mx = dis[i]; 
                    tmp = i; 
                } 
            }
        }
        now = tmp; 
    } 
    cout << (ans == inf ? -1 : ans) << endl; 
    for(int i = p - 1; i >= 1; i --) cout << (dis[i] == inf ? -1 : dis[i]) << endl;
    //time_t finish = clock();
    //cout << "time used:" << (finish-start) * 1.0 / CLOCKS_PER_SEC <<"s"<< endl;
    return 0;
}