/* -*- coding: utf-8 -*-
 *
 * 1631.cc:  No.1631 Sorting Integers (Multiple of K) Easy - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 14;
const int NBITS = 1 << MAX_N;
const int MAX_K = 1000;

/* typedef */

typedef long long ll;
typedef vector<int> vi;

/* global variables */

int cs[10], bnums[NBITS], ts[MAX_N], bts[NBITS];
vi bvs[MAX_N + 1];
ll dp[NBITS][MAX_K];

/* subroutines */

/* main */

int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= 9; i++) scanf("%d", cs + i);

  ts[0] = 1;
  for (int i = 1; i < n; i++) ts[i] = ts[i - 1] * 10 % k;

  int nbits = 1 << n;
  bnums[0] = bts[0] = 0;
  for (int bits = 1, msb = 1, msi = 0; bits < nbits; bits++) {
    if ((msb << 1) <= bits) msb <<= 1, msi++;
    bnums[bits] = bnums[bits ^ msb] + 1;
    bts[bits] = (bts[bits ^ msb] + ts[msi]) % k;
  }
  for (int bits = 0; bits < nbits; bits++)
    bvs[bnums[bits]].push_back(bits);
  //for (int i = 0; i <= n; i++) printf("%lu ", bvs[i].size()); putchar('\n');

  dp[0][0] = 1;
  for (int i = 1, l = 0; i <= 9; i++)
    if (cs[i] > 0) {
      for (auto bits: bvs[l])
	for (int j = 0; j < k; j++)
	  if (dp[bits][j] > 0)
	    for (auto bits0: bvs[cs[i]])
	      if (! (bits & bits0))
		dp[bits | bits0][(j + i * bts[bits0]) % k] += dp[bits][j];
      
      l += cs[i];
    }

  printf("%lld\n", dp[nbits - 1][0]);
  return 0;
}