#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
ll K;
int C[10];
vector<int> D;

map<int,ll> cand[1<<14];

void dfs(int mask,ll val) {
	cand[mask][val]++;
	if(__builtin_popcount(mask)*2>N) return;
	
	int i;
	FOR(i,N) if((mask&(1<<i))==0) {
		ll v=(val*10+D[i])%K;
		dfs(mask|(1<<i),v);
	}
	
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>K;
	FOR(i,9) {
		cin>>C[i+1];
		FOR(x,C[i+1]) D.push_back(i+1);
	}
	
	dfs(0,0);
	
	ll ret=0;
	int mask;
	FOR(mask,1<<N) {
		if(__builtin_popcount(mask)*2>=N) {
			ll v=1;
			FOR(x,N-__builtin_popcount(mask)) v=v*10%K;
			int sm=mask^((1<<N)-1);
			FORR2(a,b,cand[mask]) {
				ret+=1LL*b*cand[sm][(K-a*v%K)%K];
			}
		}
	}
	
	FOR(i,10) {
		FOR(x,C[i]) ret/=(x+1);
	}
	
	cout<<ret<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}