from collections import deque
import sys
input = sys.stdin.readline

N, K = map(int, input().split())
c = [0] + list(map(int, input().split()))
cnt = {}
cnt[tuple(c)] = [1] + [0] * (K-1)
que = deque()
que.append(tuple(c))
while que:
    v = que.popleft()
    for i in range(1, 10):
        if v[i] == 0:
            continue
        u = list(v)
        u[i] -= 1
        u = tuple(u)
        if u not in cnt:
            cnt[u] = [0] * K
            que.append(u)
        for r in range(K):
            n = (10 * r + i) % K
            cnt[u][n] += cnt[v][r]
print(cnt[(0,)*10][0])