#include <bits/stdc++.h>
using namespace std;

int n, k;
vector<int> c;

long long ans = 0;

void solve(int pos, vector<int> &count, int r)
{
	if (pos == n)
	{
		if (r == 0)
			ans += 1;
		return;
	}
	for (int i = 1; i <= 9; i++)
	{
		if (count[i] > 0)
		{
			count[i] -= 1;
			solve(pos + 1, count, (r * 10 + i) % k);
			count[i] += 1;
		}
	}
}

int main()
{
	cin >> n >> k;
	c = vector<int> (10, 0);
	for (int i = 1; i <= 9; i++)
	{
		cin >> c[i];
	}
	solve(0, c, 0);
	cout << ans;
}