import collections
def bitDP(c,m):
  C=len(c)
  c=[int(i) for i in c]
  dp=[[] for i in range(1<<C)]
  dp[0].append(0)
  for i in range(1<<C):
    j=bin(i).count('1')
    for k in range(C):
      if (i>>k)&1==0:
        for l in dp[i]:
          dp[i+2**k].append((l+q[m+k]*c[j])%p)
  cnt=1
  for i in collections.Counter(c).values():
    cnt*=fact[i]
  t=collections.Counter(dp[-1])
  for i in t:
    t[i]//=cnt
  return t

import itertools
n,p=map(int,input().split())
c=list(map(int,input().split()))
a=[]
for i in range(9):
  for j in range(c[i]):
    a.append(str(i+1))
all=tuple(itertools.combinations(a,n//2))
ans=0
q=[1]*(n+1)
for i in range(1,n+1):
  q[i]=(q[i-1]*10)%p
fact=[1]*(n+1)
for i in range(1,n+1):
  fact[i]=fact[i-1]*i
s=set()
for x in all:
  y=''.join(x)
  if y not in s:
    s.add(y)
  else:
    continue
  b=a.copy()
  for i in x:
    b.remove(i)
  d1=bitDP(x,(n+1)//2)
  d2=bitDP(b,0)
  #print(d1,d2)
  #print(len(d1),len(d2))
  #print(x,b)
  if 0 in d1 and 0 in d2:
    ans+=d1[0]*d2[0]
  for i in d1:
    if p-i in d2:
      ans+=d1[i]*d2[p-i]
      #print(x,b,d1[i]*d2[p-i])
print(ans)