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

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, K;
    cin >> N >> K;
    vector<int> c(10);
    for (int i = 1; i < 10; ++i) cin >> c[i];
    vector<int> cum(11);
    for (int i = 0; i < 10; ++i) cum[i+1] = cum[i] + c[i];
    vector cnt(1 << N, vector<ll>(K));
    cnt[0][0] = 1;
    for (int S = 0; S < 1 << N; ++S) {
        for (int i = 1; i < 10; ++i) {
            int j = cum[i];
            while (j < cum[i+1] && (S >> j & 1)) ++j;
            if (j == cum[i+1]) continue;
            for (int k = 0; k < K; ++k) {
                int n = (10 * k + i) % K;
                cnt[S | (1 << j)][n] += cnt[S][k];
            }
        }
    }
    cout << cnt[(1 << N) - 1][0] << endl;
}