#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<vector<ll>> dp(1<<N, vector<ll>(K, 0));
    dp[0][0] = 1;
    vector<int> c(10);

    vector<int> a;
    rep2(i, 1, 9){
        cin >> c[i];
        rep(j, c[i]) a.eb(i);
    }

    //each(e, a) cout << e << ' '; cout << '\n';

    vector<int> pw(N+1, 1);
    rep(i, N) pw[i+1] = pw[i]*10%K;
    vector<ll> fac(N+1, 1);
    rep(i, N) fac[i+1] = fac[i]*(i+1);

    rep(i, N){
        rep(j, 1<<N){
            if(__builtin_popcount(j) != i) continue;
            rep(k, K){
                if(dp[j][k] == 0) continue;
                rep(l, N){
                    if((j>>l)&1) continue;
                    int nj = j | (1<<l), nk = (k+pw[l]*a[i])%K;
                    dp[nj][nk] += dp[j][k];
                }
            }
        }
    }

    ll ans = dp.back()[0];
    rep2(i, 1, 9) ans /= fac[c[i]];
    cout << ans << '\n';
}