#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq


def input():
    return sys.stdin.readline()[:-1]


# sys.setrecursionlimit(1000000)

# _INPUT = """3 2
# 1 2 0 0 0 0 0 0 0
# """
# sys.stdin = io.StringIO(_INPUT)

INF = 10**10


N, K = map(int, input().split())
C = list(map(int, input().split()))

A = []
for i in range(9):
    A += [i+1] * C[i]

dp = [[0] * K for _ in range(1<<N)]
dp[0][0] = 1
for mask in range(1<<N):
    for r in range(K):
        if dp[mask][r] == 0:
            continue
        for i in range(N):
            if mask & (1<<i):
                continue
            mask1 = mask | (1<<i)
            r1 = (10*r+A[i]) % K
            dp[mask1][r1] += dp[mask][r]


ans = dp[(1<<N)-1][0]
for i in range(9):
    for k in range(1, C[i]+1):
        ans //= k
print(ans)