#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

#include<map>
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll n,k;
    cin>>n>>k;
    vector<int> c(10,0);
    for(int i = 1;i<=9;i++) cin>>c[i];
    if(n==1){
        int ans = 0;
        for(int i = 1;i<=9;i++) if(i%k==0) ans += c[i];
        cout<<ans<<endl;
        return 0;
    }

    vector<ll> a,b;
    ll now = 1;
    for(int i = 0;i<n;i++){
        if(i%2==0) a.push_back(now);
        else b.push_back(now);
        now *= 10;
    }
    map<vector<int>,map<ll,ll>> m1,m2;
    vector<int> use(10,0);
    ll ans = 0;
    auto calc = [&](vector<int>&now) {
        vector<int> all;
        for(int i = 1;i<=9;i++) for(int j = 0;j<now[i];j++) all.push_back(i);
        sort(all.begin(),all.end());
        do{
            ll sum = 0;
            for(int i = 0;i<a.size();i++){
                sum += a[i] * all[i];
                sum %= k;
            }
            m1[now][sum]++;
        }while(next_permutation(all.begin(),all.end()));
        
    };
    auto dfs = [&](auto dfs,int ni,int res) -> void {
        if(res==0){
            calc(use);
            return;
        }
        for(int i = ni;i<=9;i++){
            if(c[i]==0) continue;
            c[i]--;
            use[i]++;
            dfs(dfs,i,res-1);
            use[i]--;
            c[i]++;
        }
    };
    dfs(dfs,1,a.size());
    swap(a,b);
    swap(m1,m2);
    dfs(dfs,1,a.size());

    for(auto itr:m1){
        auto use = itr.first;
        vector<int> want(10,0);
        for(int i = 1;i<=9;i++) want[i] = c[i] - use[i];
        auto now = m2[want];
        for(auto nn:itr.second){
            ll w = k - nn.first;
            w %= k;
            if(w<0) w += k;
            ans += nn.second * now[w];
        }
    }

    cout<<ans<<endl;

}