import sys
from functools import lru_cache

def solve():
    N, K = map(int, sys.stdin.readline().split())
    c = list(map(int, sys.stdin.readline().split()))
    # Ensure c has exactly 9 elements
    while len(c) < 9:
        c.append(0)
    
    if K == 0:
        print(0)
        return
    
    # Precompute 10^{N-1 - pos} mod K for each pos
    pow10 = [1] * N
    for i in range(1, N):
        pow10[i] = (pow10[i-1] * 10) % K
    # Reverse to make pow10[pos] = 10^{N-1 - pos} mod K
    pow10 = pow10[::-1]
    
    @lru_cache(maxsize=None)
    def dfs(pos, rem, counts):
        if pos == N:
            return 1 if rem == 0 else 0
        total = 0
        for d in range(9):
            if counts[d] == 0:
                continue
            digit = d + 1
            new_rem = (rem + digit * pow10[pos]) % K
            new_counts = list(counts)
            new_counts[d] -= 1
            new_counts = tuple(new_counts)
            total += dfs(pos + 1, new_rem, new_counts)
        return total
    
    initial_counts = tuple(c)
    result = dfs(0, 0, initial_counts)
    print(result)

if __name__ == "__main__":
    solve()