#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int N,K,c[14];
long V=1;
vector<int>A[1<<14];
void dfs(int k,int now,int rest)
{
	if(rest==0)
	{
		A[k].push_back(now);
	}
	else
	{
		for(int i=0;i<N;i++)if(!(k>>i&1))
		{
			dfs(k|1<<i,(now*10L+c[i])%K,rest-1);
		}
	}
}
main()
{
	cin>>N>>K;
	int sz=0;
	for(int i=1;i<=9;i++)
	{
		int C;cin>>C;
		for(;C;V*=C--)c[sz++]=i;
	}
	long ans=0;
	dfs(0,0,N/2);
	if(N%2==0)
	{
		long P10=1;
		for(int i=0;i<N/2;i++)P10=P10*10%K;
		int comb=(1<<N/2)-1;
		while(comb<1<<N)
		{
			vector<int>Ac=A[comb];
			for(int&a:Ac)a=(K-P10*a%K)%K;
			sort(Ac.begin(),Ac.end());
			int u=(1<<N)-1-comb;
			sort(A[u].begin(),A[u].end());
			int ic=0,iu=0;
			while(ic<Ac.size()&&iu<A[u].size())
			{
				if(Ac[ic]<A[u][iu])ic++;
				else if(Ac[ic]>A[u][iu])iu++;
				else
				{
					int l=0;
					int p=A[u][iu];
					while(ic<Ac.size()&&p==Ac[ic])ic++,l++;
					while(iu<A[u].size()&&p==A[u][iu])iu++,ans+=l;
				}
			}
			int x=comb&-comb,y=comb+x;
			comb=(comb&~y)/x>>1|y;
		}
	}
	else
	{
		dfs(0,0,N-N/2);
		long P10=1;
		for(int i=0;i<N-N/2;i++)P10=P10*10%K;
		int comb=(1<<N/2)-1;
		while(comb<1<<N)
		{
			for(int&a:A[comb])a=(K-P10*a%K)%K;
			sort(A[comb].begin(),A[comb].end());
			int u=(1<<N)-1-comb;
			sort(A[u].begin(),A[u].end());
			int ic=0,iu=0;
			while(ic<A[comb].size()&&iu<A[u].size())
			{
				if(A[comb][ic]<A[u][iu])ic++;
				else if(A[comb][ic]>A[u][iu])iu++;
				else
				{
					int l=0;
					int p=A[u][iu];
					while(ic<A[comb].size()&&p==A[comb][ic])ic++,l++;
					while(iu<A[u].size()&&p==A[u][iu])iu++,ans+=l;
				}
			}
			int x=comb&-comb,y=comb+x;
			comb=(comb&~y)/x>>1|y;
		}
	}
	cout<<ans/V<<endl;
}