#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;

int main() {
  constexpr int D = 10;
  int n, k; cin >> n >> k;
  vector<int> c;
  FOR(i, 1, D) {
    int ci; cin >> ci;
    while (ci--) c.emplace_back(i);
  }
  vector dp(1 << n, vector(k, 0LL));
  dp[0][0] = 1;
  REP(i, 1 << n) REP(j, k) {
    REP(x, n) {
      if ((i >> x & 1) || (x > 0 && c[x] == c[x - 1] && !(i >> (x - 1) & 1))) continue;
      dp[i | (1 << x)][(j * 10 + c[x]) % k] += dp[i][j];
    }
  }
  cout << dp[(1 << n) - 1][0] << '\n';
  return 0;
}