#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000005

long long ans = 0LL;
int K;
int n;
vector<int> c;
map<int,int> cnt[16384];
void dfs0(long long cur,int b){
	if(__builtin_popcount(b)==n/2){
		cnt[b][cur%K] ++;
		return;
	}
	rep(i,n){
		if((b>>i)&1)continue;
		if(i!=0 && ((b>>(i-1))&1)==0 && c[i]==c[i-1])continue;
		int nb = b | (1<<i);
		dfs0(cur*10 + c[i],nb);
	}
	
}

void dfs1(long long cur,int b){
	if(__builtin_popcount(b)==(n+1)/2){
		rep(i,n/2)cur *= 10;
		cur %= K;
		cur = (K-cur)%K;
		b = ((1<<n)-1) ^ b;
		ans += cnt[b][cur];
		return;
	}
	for(int i=n-1;i>=0;i--){
		if((b>>i)&1)continue;
		if(i!=n-1 && ((b>>(i+1))&1)==0 && c[i]==c[i+1])continue;
		int nb = b | (1<<i);
		dfs1(cur*10 + c[i],nb);
	}
	
}

int main(){
	
	cin>>n>>K;
	
	rep(i,9){
		int t;
		cin>>t;
		rep(j,t)c.push_back(i+1);
	}
	
	dfs0(0,0);
	dfs1(0,0);
	cout<<ans<<endl;
	return 0;
}