#include<bits/stdc++.h>

using namespace std;

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

signed main(){
	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);
	}
	
	auto calc_nxt = [&](int bit, int use){
		auto C = 0, fs = -1;
		for(int i = 0; i < N; i++){
			if(A[i] == use and ((bit >> i) & 1)) C++;
			if(A[i] == use and fs < 0) fs = i;
		}
		if(C >= cnt[use] or fs < 0) return -1;
		return (bit | (1 << (fs + C)));
	};
	
	dp[0][0] = 1;
	
	for(int cur = 0; cur < (1 << N); cur++){
		for(int i = 0; i < K; i++){
			for(int j = 1; j < 10; j++){
				int nxt = calc_nxt(cur, j);
				if(nxt >= 0){
					dp[nxt][(i * 10 + j) % K] += dp[cur][i];
				}
			}
		}
	}
	cout << dp[(1 << N) - 1][0] << endl;
	return 0;
}