//#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<ll>>;

vector<vll> BOX;
//max C size 通りの全列挙
void next_combination(ll size, ll max, vll now_vector) {
	ll now_size = now_vector.size();
	if (now_size == size) {
		BOX.push_back(now_vector);
	}
	else {
		vll next = now_vector;
		if (now_size == 0) {
			for (ll i = 0; i < max; i++) {
				next.push_back(i);
				next_combination(size, max, next);
				next.pop_back();
			}
		}
		else {
			ll LAST = next[now_size - 1];
			for (ll i = LAST + 1; i < max; i++) {
				next.push_back(i);
				next_combination(size, max, next);
				next.pop_back();
			}
		}
	}
	return;
}



int main() {
	ll N, K;
	cin >> N >> K;
	vll C(9);
	vll D;
	vll per(15, 1);
	rep(i, 14) {
		per[i + 1] = per[i] * (i + 1);
	}
	ll PPP = 1;
	rep(i, 9) {
		cin >> C[i];
		PPP *= per[C[i]];
		rep(j, C[i])D.push_back(i + 1);
	}
	ll pp = 1;
	rep(i, N / 2) {
		pp *= 10;

	}
	next_combination(N / 2, N, {});
	ll an = 0;
	set<vll> Poo;
	rep(i, BOX.size()) {
		map<ll, ll> M1;
		map<ll, ll> M2;
		vll AUU = BOX[i];
		vll AU;
		set<ll> S;
		rep(k, AUU.size()) {
			S.insert(AUU[k]);
			AU.push_back(D[AUU[k]]);

		}
		if (Poo.count(AU))continue;
		Poo.insert(AU);
		vll BU;
		rep(k, N) {
			if (!S.count(k))BU.push_back(D[k]);
		}
		ll kk = 1;
		do {
			kk = 1;
			ll x = 0;
			rep(u, AU.size()) {
				x += AU[u] * kk;
				kk *= 10;
				kk %= K;
				x %= K;
			}
			M1[x]++;

		} while (next_permutation(all(AU)));

		ll pp = kk;
		do {
			kk = pp;
			ll x = 0;
			rep(u, BU.size()) {
				x += BU[u] * kk;
				kk *= 10;
				kk %= K;
				x %= K;
			}
			if (x == 0)x += K;
			M2[x]++;

		} while (next_permutation(all(BU)));

		for (auto w : M1) {
			if (M2.count(K - w.first)) {
				an += w.second * M2[K - w.first];
			}
		}
	}
	cout << an << endl;
}