#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using namespace std;


template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

typedef long long ll;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, k; cin >> n >> k;
    vector<int> c(10);
    for(int i = 1; i <= 9; i++) cin >> c[i];
    auto dp = vec3d<ll>(2, 1<<n, k, 0);
    dp[0][0][0] = 1;
    vector<int> pow10(n);
    pow10[0] = 1%k;
    for(int i = 1; i < n; i++){
        pow10[i] = (pow10[i-1]*10)%k;
    }
    int sum = 0;
    int mask = (1<<n)-1;
    auto popcount = [&](int s){
        int ans = 0;
        for(int i = 0; i < n; i++){
            if(s&(1<<i)) ans++;
        }
        return ans;
    };
    for(int i = 1; i <= 9; i++){
        int cur = i%2;
        int pre = cur^1;
        for(int j = 0; j < 1<<n; j++){
            for(int l = 0; l < k; l++){
                dp[cur][j][l] = 0;
            }
        }
        for(int j = 0; j < 1<<n; j++){
            if(popcount(j) != sum) continue;
            int rem = mask^j;
            vector<int> u;
            for(int s = rem; s >= 0; s = (s-1)&rem){
                if(popcount(s) == c[i]){
                    assert((j&s) == 0);
                    int nx = 0;
                    for(int l = 0; l < n; l++){
                        if(s&(1<<l)) nx += pow10[l]*i;
                    }
                    nx %= k;
                    for(int l = 0; l < k; l++){
                        dp[cur][j+s][(nx+l)%k] += dp[pre][j][l];
                    }
                }
                if(s == 0) break;
            }
        }
        sum += c[i];
    }
    cout << dp[1][mask][0] << endl;
}