#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
const int N = 31, mod = 1234567891;
ll dp[2][N], c[N][N], fac[N];
int cnt[1005], n, p;
signed main() {
	cin >> n >> p;
	rep(i, 1, n) {
		int x;
		cin >> x;
		++cnt[(x % p + p) % p];
	}
	fac[0] = 1;
	rep(i, 1, N - 1) fac[i] = fac[i - 1] * i % mod;
	c[0][0] = 1;
	rep(i, 1, N - 1) {
		c[i][0] = 1;
		rep(j, 1, i) c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
	}
	int pr = 0, nw = 1;
	ll F = 1;
	int s = 0;
	dp[0][0] = 1;
	rep(i, 0, p - 1) if (cnt[i]) {
		for (int j = 0; j <= s; ++j) if (dp[pr][j])
			for (int k = 1; k <= cnt[i]; ++k)
				for (int h = 0; h <= k && h <= j; ++h)
					(dp[nw][j - h + cnt[i] - k]
						+= dp[pr][j] * c[j][h] % mod * c[s + 1 - j][k - h] % mod
						* c[cnt[i] - 1][k - 1] % mod) %= mod;
		s += cnt[i];
		swap(nw, pr);
		memset(dp[nw], 0, sizeof dp[nw]);
		(F *= fac[cnt[i]]) %= mod;
	}
	cout << dp[pr][0]*F % mod;
	return 0;
}