#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int pw[20];
long long dp[14][1 << 14][1000];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	long long sub = 1;
	vector<int>v;
	rep(i, 9) {
		int c; cin >> c;
		rep(j, c)v.push_back(i + 1);
		rep(j, c)sub *= j + 1;
	}
	pw[0] = 1 % m;
	rep(i, 14)pw[i + 1] = (pw[i] * 10) % m;
	dp[0][0][0] = 1;
	int bef = -1;
	rep(i, n) {
		rrep(j, (1 << n)) {
			rep(k, n) {
				if (j &(1 << k))continue;
				int nj = j | (1 << k);
				rep(l, m) {
					int nl = (l + pw[k] * v[i]) % m;
					dp[i + 1][nj][nl] += dp[i][j][l];
				}
			}
		}
		/*
		rep(j, 1 << n) {
			rep(k, m) {
				cout << dp[i + 1][j][k] << " ";
			}
			cout << endl;
		}
		cout << endl;*/
	}
	long long ans = dp[n][(1 << n) - 1][0] /sub;

	cout << ans << endl;
	return 0;
}