#include<bits/stdc++.h>

using namespace std;

using ll = long long;

vector<vector<ll>> dp(1<<14, vector<ll>(1001, 0));

signed main(){
    // 階乗をすぐとれるように
    vector<ll> fac(17, 1);
    for(int i = 2; i < 17; i++) fac[i] = fac[i - 1] * i;
    
	int N,K;
	cin >> N >> K;
	vector<int> cnt(10, 0), A;
	for(int i = 1; i < 10; i++){
	    cin >> cnt[i];
	    for(int j = 0; j < cnt[i]; j++) A.push_back(i);
	}
	
	dp[0][0] = 1;
	
	for(int cur = 0; cur < (1 << N); cur++){
	   for(int i = 0; i < N; i++){
	       if(!((cur>>i) & 1)){
	           for(int j = 0; j < K; j++){
	               dp[cur | (1<<i)][(j * 10 + A[i]) % K] += dp[cur][j];
	           }
	       }
	   }
	}
	ll res = dp[(1<<N) - 1][0];
	for(int i = 1; i < 10; i++) res /= cnt[i];    
	cout << res << endl;
	return 0;
}