#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint;

int n, k;
int c[10];
string s;
int CNT = 0;
unordered_map<string, unordered_map<int, int>> mp;
ll ans;
mint P;

void dfs1(int rest, int i) {
    if (rest == 0) {
        auto& m = mp[s];
        do {
            int r = (mint(stoi(s)) * P).val();
            m[r]++;
        } while(next_permutation(all(s)));
        return;
    }
    if (i == 10) return;
    for(int cnt = 0; cnt <= min(rest, c[i]); cnt++) {
        s.append(cnt, '0' + i);
        dfs1(rest - cnt, i + 1);
        s.resize(s.size() - cnt);
    }
}

string s2;
void dfs2(int rest, int i) {
    if (i == 10) {
        if (rest) return;
        auto& m = mp[s];
        do {
            int r = (-mint(stoi(s2))).val();
            ans += m[r];
        } while(next_permutation(all(s2)));
        return;
    }
    for(int cnt = 0; cnt <= min(rest, c[i]); cnt++) {
        s2.append(cnt, '0' + i);
        s.append(c[i] - cnt, '0' + i);
        dfs2(rest - cnt, i + 1);
        s.resize(s.size() - (c[i] - cnt));
        s2.resize(s2.size() - cnt);
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> k;
    rep(i, 9) cin >> c[i + 1];
    if (n == 1) {
        int d = 1;
        while(!c[d]) d++;
        cout << int(d % k == 0) << endl;
        return 0;
    }
    mint::set_mod(k);
    int n1 = n / 2, n2 = n - n1;
    P = 1;
    rep(_, n2) P *= 10;
    dfs1(n1, 1);
    dfs2(n2, 1);
    cout << ans << endl;
}