#include<iostream>
#include<array>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
#include<cassert>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
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(b<a){a=b;return 1;}return 0;}

int n,K,c[10];
ll dp[10][17000][1010];
ll X[20010],po[20010];

void solve(){
    cin >> n >> K;
    int U=(1<<n);
    Rep(i,1,10) cin >> c[i];
    po[0]=1;
    rep(i,n) po[i+1]=po[i]*10;
    rep(S,U){
        rep(i,n){
            if(S&(1<<i)) X[S]+=po[i];
        }
        //X[S]%=K;
        //cout << bitset<3>(S) << " " << X[S] << endl; 
    }
    int k=0;
    dp[0][0][0]=1;
    rep(i,9){
        int x,y;
        //cout << i << endl;
        for(int S = (1 << k) - 1; S < (1 << n); x = S & -S, y = S + x, S = (((S & ~y) / x) >> 1) | y) {
            if(c[i+1]==0) {
                rep(r,k) dp[i+1][S][r]=dp[i][S][r];
                continue;
            }
            int x_,y_;
            for(int T = (1 << c[i+1]) - 1; T < (1 << n); x_ = T & -T, y_ = T + x_, T = (((T & ~y_) / x_) >> 1) | y_) {
                if(S&T) continue;
                //cout << bitset<3>(S) << " " << bitset<3>(T) << endl;
                rep(r,K){
                    //cout << r << endl;
                    dp[i+1][S|T][(r+(i+1)*X[T])%K]+=dp[i][S][r];
                }
            }
            if(S==0) break;
        }
        k+=c[i+1];
    }
    cout << dp[9][(1<<n)-1][0] << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}