#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}



void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N, K;
    cin >> N >> K;
    vector<pair<int, int>> p;
    rep(i, 1, 10){
        int c;
        cin >> c;
        if (c) p.push_back({i, c});
    }
    int B = 0, sc = 0;
    rep(i, 0, 1 << (int)p.size()){
        int tmp = 0;
        rep(j, 0, p.size()) if (i & (1 << j)) tmp += p[j].second;
        if (tmp * 2 <= N && chmax(sc, tmp)) B = i;
    }
    vector<vector<pair<int, int>>> q(2);
    rep(i, 0, p.size()) q[(B & (1 << i) ? 0 : 1)].push_back(p[i]);
    vector<vector<int>> m(1 << N);
    ll ans = 0;
    int po1 = 0, po2 = 0;
    // po1 -= clock();
    rep(id, 0, 2){
        vector<int> A;
        for (auto [a, b] : q[id]){
            while (b--) A.push_back(a);
        }
        while (N != (int)A.size()) A.push_back(0);
        So(A);
        vector<ll> val(N + 1);
        vector<int> tmp(N + 1);
        int st = 0;
        auto f = [&]() -> bool {
            for (int i = N - 1; i > 0; i--) if (A[i - 1] < A[i]){
                st = i - 1;
                reverse(A.begin() + i, A.end());
                for (int j = i; j < N; j++) if (A[i - 1] < A[j]){
                    swap(A[i - 1], A[j]);
                    break;
                }
                return true;
            }
            return false;
        };
        do{
            rep(i, st, N){
                val[i + 1] = val[i] * 10 + A[i];
                tmp[i + 1] = tmp[i] + (min(A[i], 1) << i);
            }
            val[N] %= K;
            // po2 -= clock();
            if (id == 0){
                m[tmp[N]].push_back(val[N]);
            }
            else{
                int v = (K - val[N]) % K;
                int t = (1 << N) - 1 - tmp[N];
                ans += UB(m[t], v) - LB(m[t], v);
            }
            // po2 += clock();
        }while (f());
        if (id == 0) for (auto &x : m) So(x);
        // cout << po2 << "\n";
    }
    // po1 += clock();
    // cout << po1 << "\n";
    cout << ans << "\n";
}