#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=100010;
ll n,p,a[N],b[N],f[N],ans;
ll qpow (ll x,ll y) {
    ll sum=1;
    if (y<0) return 0;
    while (y) {
        if (y&1) {
            sum*=x;
            sum%=p;
        }
        x*=x;
        x%=p;
        y>>=1;
    }
    return sum;
}
ll C (ll x,ll y) {
    return qpow(f[y],p-2)%p*qpow(f[x-y],p-2)%p*f[x]%p;
}
int main () {
    freopen("BBQ.in","r",stdin);
    freopen("BBQ.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0); 
    cin >> n >> p;
    if (p==2||p==3) {
        cout << 0 <<endl;
        return 0;
    }
    f[0]=1;
    for (int i=1;i<=100000;i++) f[i]=f[i-1]*i%p;
    for (int i=1;i<=n;i++) cin >> a[i] >> b[i];
    for (int i=1;i<=n;i++) {
        for (int j=i+1;j<=n;j++) {
            ans=(ans+C(a[i]+a[j]+b[i]+b[j],a[i]+a[j])%p)%p;
        }
    }
    cout << ans <<endl;
    return 0;
}