#include <bits/stdc++.h>
using namespace std;
 
#define rep(i,j,n) for(int i=j;i<n;++i)
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(), i.rend()
#define INF 1e9
#define LINF 1e18
const int mod = 998244353;
 
using i64 = long long;
using pi = pair<int, int>;
 
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
 
i64 gcd(i64 n, i64 m) {return (m == 0? n : gcd(m, n % m));}
i64 lcm(i64 n, i64 m) {return (n / gcd(n, m) * m);}
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};

i64 pow(i64 x, i64 n, i64 mod) {
  i64 ret = 1;
  while(n > 0) {
    if(n & 1) (ret *= x) %= mod;
    (x *= x) %= mod;
    n >>= 1;
  }
  return ret;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n, K;
  cin >> n >> K;
  vt<int> c(9);
  vt<int> a;
  rep(i, 0, 9) {
    cin >> c[i];
    rep(j, 0, c[i]) a.push_back(i + 1);
  }

  vvt<int> dp(1 << n, vt<int>(K, 0));
  dp[0][0] = 1;
  rep(bit, 0, 1 << n) {
    int cnt = 0;
    rep(j, 0, n) {
      if(bit & (1 << j)) cnt++;
    }
    int num = pow(10, cnt, K);

    rep(j, 0, n) {
      if(bit & (1 << j)) continue;
      for(i64 k = 0; k < K; ++k) {
        dp[bit | (1 << j)][(k + a[j] * num) % K] += dp[bit][k];
      }
    }
  }

  int ans = dp[(1 << n) - 1][0];
  rep(i, 0, 9) {
    rep(j, 0, c[i]) {
      ans /= (j + 1);
    }
  }
  cout << ans << endl;
}