N,mod=map(int,input().split())
C=list(map(int,input().split()))
A=[]
for i in range(9):
  for j in range(C[i]):
    A.append(i+1)
ANS=0
M=(N+1)>>1
L=N>>1
P=[pow(10,i,mod) for i in range(N+1)]
DP=[dict() for i in range(1<<N)]
DP[0][0]=1
for i in range(1<<N):
  c=bin(i).count('1')
  if c>=M:
    continue
  for j in range(N):
    if (i>>j)&1:
      continue
    if j>0 and A[j-1]==A[j] and (i>>(j-1))&1==0:
      continue
    for k in DP[i].keys():
      DP[i|(1<<j)][(k*10+A[j])%mod]=DP[i][k]+DP[i|(1<<j)].get((k*10+A[j])%mod,0)
for i in range(1<<N):
  c=bin(i).count('1')
  if c==L:
    x=((1<<N)-1)^i
    y=[0]*10
    for j in range(9):
      y[j+1]=y[j]+C[j]
    z=0
    p=0
    for k in range(N):
      while y[p]==k:
        p+=1
      if (x>>k)&1:
        z|=(1<<y[p-1])
        y[p-1]+=1
    x=z
    if len(DP[x])>0 and len(DP[i])>0:
      for j in DP[i].keys():
        y=DP[x].get((-j*P[N-c])%mod,0)
        ANS+=y*DP[i][j]
print(ANS)