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=[0]+list(map(int,readline().split()))
n=N//2
dct=defaultdict(int)
for s in range(10**(n-1),10**n):
    if "0" in str(s):
        continue
    CC=[0]*10
    for i in str(s):
        CC[int(i)]+=1
    dct[(tuple(CC),s*10**(N-n)%K)]+=1
ans=0
for s in range(10**(N-n-1),10**(N-n)):
    if "0" in str(s):
        continue
    CC=[0]*10
    for i in str(s):
        CC[int(i)]+=1
    ans+=dct[(tuple([c-cc for c,cc in zip(C,CC)]),(-s)%K)]
print(ans)