#include <bits/stdc++.h> using namespace std; #include <atcoder/all> using namespace atcoder; using ll=long long; using Graph=vector<vector<pair<int,int>>>; #define MAX 100000 #define MOD 1000000007 #define INF 1000000000 int main(){ int N; int K; cin>>N>>K; vector<int> c(9); for(int i=0;i<9;i++){ cin>>c[i]; } vector<int> res(N,1); for(int i=1;i<N;i++){ res[i]=res[i-1]*10%K; } vector<vector<ll>> dp(1<<N,vector<ll>(K,0)); dp[0][0]=1; int sum=0; for(int i=0;i<9;i++){ if(c[i]==0){ continue; } vector<int> bits;; for(int j=0;j<(1<<N);j++){ int cnt=0; int bit=0; for(int k=0;k<N;k++){ if(((j>>k)&1)==1){ bit+=(1<<k); cnt++; } } if(cnt==c[i]){ bits.push_back(bit); } } int n=bits.size(); for(int j=0;j<n;j++){ int x=0; for(int k=0;k<N;k++){ if(((bits[j]>>k)&1)==1){ x+=res[k]; } } //cout<<x<<endl; x*=i+1; x%=K; //cout<<x<<endl; for(int k=0;k<(1<<N);k++){ if((bits[j]&k)!=0){ continue; } int cnt=0; for(int l=0;l<N;l++){ if(((k>>l)&1)==1){ cnt++; } } if(cnt!=sum){ continue; } for(int l=0;l<K;l++){ dp[bits[j]+k][(l+x)%K]+=dp[k][l]; } } } sum+=c[i]; } cout<<dp[(1<<N)-1][0]<<endl; }