C. Kuroni and Impossible Calculation

鸽巢原理，当n>mod，则至少存在两个同余的数。a%k同余b%k->abs(a-b)%k==0

const int N = 2e5+5;
 
int t;
int a[N];
int main()
{
	ll n,m;
	while (cin >> n >> m)
	{
		f(i, 1, n)scanf("%d", &a[i]);
		if(n > m) { puts("0");continue; }
		ll ans = 1;
		f(i, 1, n)
		{
			f(j, i + 1, n)
			{
				ans = ans * abs(a[i] - a[j]) % m;
			}
		}
		cout << ans << endl;
	}
	return 0;
}