#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(10);rep(i,9)cin >> v[i+1];
  map<pair<vl,ll>,ll> mp;
  vl init(10);mp[{init,0}]=1;
  rep(i,n){
    map<pair<vl,ll>,ll> nmp;
    for(auto p:mp){
      auto vs=p.first.first;
      auto val=p.second;
      auto rem=p.first.second;
      for(int j=1;j<10;j++){
        if(vs[j]>=v[j])continue;
        vl nvs=vs;
        nvs[j]++;
        nmp[{nvs,(rem*10+j)%k}]+=val;
      }
    }
    swap(mp,nmp);
  }
  cout << mp[{v,0}] << endl;
  /*for(auto p:mp){
    cout << p.first.second << endl;
    for(auto q:p.first.first)cout << q <<" ";cout << endl;
  }*/
}