#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < int(n); i++)
using ll = long long;
using P = pair<int, int>;

// i桁まで決定されていて、数字の残りがvector<int> aで、数字 % K == jとなるものの通り数

int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    
    int n, K; cin >> n >> K;
    vector<int> c(10);
    rep(i, 9) cin >> c[i + 1];
    vector<map<pair<vector<int>, int>, ll>> dp(n + 1);
    dp[0][{c, 0}] = 1;
    rep(i, n) {
        for (auto elem : dp[i]) {
            vector<int> left = elem.first.first;
            int mod = elem.first.second;
            ll val = elem.second;
            for (int j = 1; j <= 9; j++) {
                if (left[j] == 0) continue;
                int nmod = (mod * 10 + j) % K; 
                left[j]--;
                dp[i + 1][{left, nmod}] += val;
                left[j]++;
            }
        }
    }
    ll ans = 0;
    for (auto elem : dp[n]) {
        vector<int> left = elem.first.first;
        int mod = elem.first.second;
        ll val = elem.second;
        if (mod == 0) ans += val;
    }
    cout << ans << endl;

    return 0;
}