#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
int main(){
  ll n,k;cin >> n >> k;
  vl v(9);rep(i,9)cin >> v[i];
  unordered_map<ll,ll> mp;
  mp[0]=1;
  rep(i,n){
    unordered_map<ll,ll> nmp;
    for(auto p:mp){
      ll t=p.first/1000;
      ll rem=p.first%1000;
      ll now=t;
      ll check=1;
      rep(i,9){
        if(now%3<v[i]){
          ll to=(t+check)*1000;
          to+=(rem*10+i+1)%k;
          nmp[to]+=p.second;
        }
        check*=3;
        now/=3;
      }
    }
    swap(mp,nmp);
  }
  ll now=0;
  per(i,9){
    now*=3;now+=v[i];
  }
  now*=1000;
  //cout << now << endl;
  cout << mp[now] << endl;
}