#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

long long mod_pow(long long base, long long exponent, int mod) {
  base %= mod;
  long long res = 1;
  while (exponent > 0) {
    if (exponent & 1) (res *= base) %= mod;
    (base *= base) %= mod;
    exponent >>= 1;
  }
  return res;
}

int main() {
  int n, k; cin >> n >> k;
  vector<int> c;
  FOR(i, 1, 10) {
    int ci; cin >> ci;
    while (ci--) c.emplace_back(i);
  }
  if (n == 1) {
    cout << (c.front() % k == 0) << '\n';
    return 0;
  }
  const int m = n / 2;
  set<string> st;
  map<string, map<int, int>> middle;
  auto init = [&](string s) -> void {
    map<int, int> &mp = middle[s];
    if (!mp.empty()) return;
    do {
      ll x = 0;
      for (char c : s) x = (x * 10 + (c - '0')) % k;
      ++mp[x];
    } while (next_permutation(ALL(s)));
  };
  ll ans = 0;
  int comb = (1 << m) - 1;
  while (comb < (1 << n)) {
    string s = "", t = "";
    REP(i, n) (comb >> i & 1 ? s : t) += '0' + c[i];
    if (st.emplace(s).second) {
      init(s);
      init(t);
      for (auto [i, pat] : middle[s]) {
        int j = -i * mod_pow(10, n - m, k) % k;
        if (j < 0) j += k;
        if (middle[t].count(j) == 1) ans += 1LL * pat * middle[t][j];
      }
    }

    int x = comb & -comb, y = comb + x;
    comb = (((comb & ~y) / x) >> 1) | y;
  }
  cout << ans << '\n';
  return 0;
}