#include <bits/stdc++.h>
using namespace std;

int main() {
    int N,K;
    cin >> N >> K;
    vector<int>tmp(9),a,b;
    for(int i = 0; i < 9; i++) {
        cin >> tmp[i];
        bool flag = a.size()+tmp[i] < N/2;
        for(int j = 0; j < tmp[i]; j++) {
            if(flag) {
                a.push_back(i+1);
            }
            else {
                b.push_back(i+1);
            }
        }
    }
    vector<map<int,int>>mp(1<<N);
    for(int i = 0; i < (1 << N); i++) {
        if(__builtin_popcount(i) != a.size()) {
            continue;
        }
        do {
            int cnt = 0;
            long long tmp2 = 1;
            long long tmp3 = 0;
            for(int j = 0; j < N; j++) {
                if(1 & (i >> j)) {
                    tmp3 += tmp2*a[cnt]%K;
                    tmp3 %= K;
                    cnt++;
                }
                tmp2 *= 10;
                tmp2 %= K;
            }
            mp[i][tmp3]++;
        }while(next_permutation(a.begin(),a.end()));
    }
    long long ans = 0;
    for(int i = 0; i < (1 << N); i++) {
        if(__builtin_popcount(i) != b.size()) {
            continue;
        }
        do {
            int cnt = 0;
            long long tmp2 = 1;
            long long tmp3 = 0;
            for(int j = 0; j < N; j++) {
                if(1 & (i >> j)) {
                    tmp3 += tmp2*b[cnt]%K;
                    tmp3 %= K;
                    cnt++;
                }
                tmp2 *= 10;
                tmp2 %= K;
            }
            ans += mp[((1 << N)-1)^i][(K-tmp3)%K];
        }while(next_permutation(b.begin(),b.end()));
    }
    cout << ans << endl;
}