codeforces 1305C（思维）

#include<bits/stdc++.h>
#define x first
#define y second
#define PB push_back
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define rep(x,l,u) for(ll x=l;x<u;x++)
#define rrep(x,l,u) for(ll x=l;x>=u;x--)
#define sz(x) x.size()
#define IOS ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<char,char> PCC;
typedef long long ll;
typedef pair<ll,ll> PLL;
const int N=2*1e5+10;
const int M=1e5+10;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
ll a[N];
void solve(){
    int n,m;scanf("%d%d",&n,&m);
    rep(i,0,n) scanf("%lld",&a[i]);
    if(n>m) {printf("0\n");return;}
    ll ans=1;
    rep(i,0,n){
        rep(j,i+1,n){
            ans=(ans*abs(a[i]-a[j]))%m;
        }
    }
    printf("%lld\n",ans);
}
int main(){
    //IOS;
    //freopen("test.txt", "r", stdin);
    //freopen("test.txt", "w", stdout);
    //int t;cin>>t;
    //while(t--)
        solve();
    return 0;
}