import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#sys.set_int_max_str_digits(10**9)

N,K=map(int,readline().split())
C=list(map(int,readline().split()))
number=[]
for i in range(9):
    number+=[i+1]*C[i]
n=N//2
ans=0
for tpl0 in itertools.combinations(number,n):
    C1=C[:]
    for i in tpl0:
        C1[i-1]-=1
    tpl1=tuple()
    for i in range(9):
        tpl1+=(i+1,)*C1[i]
    dct=defaultdict(int)
    for M0 in itertools.permutations(tpl0):
        M0=int("".join(map(str,M0)))
        dct[M0*10**(N-n)%K]+=1
    for M1 in itertools.permutations(tpl1):
        M1=int("".join(map(str,M1)))
        ans+=dct[(-M1)%K]
for c in C:
    for i in range(1,c+1):
        ans//=i
print(ans)