import sys
from itertools import permutations
from collections import defaultdict
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


N,K = MI()
C = [0]+LI()
A = []
for i in range(1,10):
    for _ in range(C[i]):
        A.append(i)

power = [1]
for _ in range(N):
    power.append((power[-1]*10) % K)

N0,N1 = N//2,N-N//2
ans = 0
for i in range(1<<N):
    X,Y = [],[]
    for j in range(N):
        if (i>>j) & 1:
            X.append(A[j])
        else:
            Y.append(A[j])
    if len(X) != N0:
        continue

    dic_X = defaultdict(int)
    for Z in permutations(X,N0):
        x = 0
        for j in range(N0):
            x += Z[j]*power[j]
            x %= K
        dic_X[x] += 1
    dic_Y = defaultdict(int)
    for Z in permutations(Y,N1):
        y = 0
        for j in range(N1):
            y += Z[j]*power[j]
            y %= K
        dic_Y[y] += 1

    for k in dic_X.keys():
        ans += dic_X[k]*dic_Y[(-k*power[N1]) % K]

for i in range(1,10):
    for j in range(C[i]):
        ans //= j+1

print(ans)