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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, k, v, S = 0, cnt = 0;
    cin >> n >> k;
    vector<int> b(n);
    vector<vector<ll>> dp(1 << n, vector<ll>(k));
    for(int i = 1; i < 10; i++){
        cin >> v;
        for(int j = 0; j < v; j++){
            if(j) S |= 1 << j + cnt;
            b[j + cnt] = i;
        }
        cnt += v;
    }
    dp[0][0] = 1;
    for(int i = 0; i < (1 << n); i++){
        for(int j = 0; j < k; j++){
            if(dp[i][j] == 0) continue;
            for(int l = 0; l < n; l++){
                if(i >> l & 1) continue;
                if((S >> l & 1) && (~i >> (l - 1) & 1)) continue;
                dp[i | (1 << l)][(j * 10 + b[l]) % k] += dp[i][j];
            }
        }
    }
    cout << dp.back()[0] << '\n';
}