import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum B = 10;

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const K = readLong();
      auto C = new int[B];
      foreach (x; 1 .. B) {
        C[x] = readInt();
      }
      
      long ans;
      void dfs(int pos, long val) {
        if (pos == N) {
          if (val == 0) {
            ++ans;
          }
        } else {
          val *= 10;
          val %= K;
          foreach (x; 1 .. B) {
            if (++val == K) val = 0;
            if (C[x] > 0) {
              --C[x];
              dfs(pos + 1, val);
              ++C[x];
            }
          }
        }
      }
      dfs(0, 0);
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}