#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    int N, K; cin >> N >> K;

    vector<int> c(10, 0);
    rep2(i, 1, 9) cin >> c[i];

    vector<ll> pw(8, 1);
    rep(i, 7) pw[i+1] = pw[i]*10;

    if(N == 1){
        rep(j, 10){
            if(c[j] == 1){
                cout << (j%K == 0? 1 : 0) << '\n';
                return 0;
            }
        }
    }

    int n = N/2, m = N-n;
    vector<int> d(10, 0);
    vector<int> u(n), v(m);
    ll ans = 0;
    vector<int> cnt(pw[m], 0);

    for(int i = pw[n-1]; i < pw[n]; i++){
        fill(all(d), 0);
        int memo = i;
        bool flag = false;

        rep(j, n){
            int k = memo%10;
            if(d[k]++ == c[k]) flag = true;
            u[j] = k;
            memo /= 10;
        }

        rep(j, n-1){
            if(u[j] > u[j+1]) flag = true;
        }

        if(flag) continue;

        int ptr = 0;
        rep(j, 10){
            rep(k, c[j]-d[j]){
                v[ptr++] = j;
            }
        }

        vector<int> tmp;

        do{
            int r = 0;
            each(e, v){
                r *= 10, r += e;
            }
            r %= K;
            cnt[r]++;
            tmp.eb(r);
        } while(next_permutation(all(v)));

        do{
            ll r = 0;
            each(e, u){
                r *= 10, r += e;
            }
            r *= pw[m], r %= K;
            int R = (K-r)%K;
            if(R < pw[m]) ans += cnt[R];
        } while(next_permutation(all(u)));

        each(e, tmp) cnt[e]--;
    }

    cout << ans << '\n';
}