#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define maxn 200005
ll a[maxn],b[maxn];

int c[2000][2000];

ll n,mod;

int main(){
	
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	
	freopen("BBQ.in","r",stdin);
	freopen("BBQ.out","w",stdout);
	
	cin>>n>>mod;
	
	
	for(int i=1;i<=n;i++){
		cin>>a[i]>>b[i];
	}
	
	c[0][0]=1;
	for(int i=1;i<=1995;i++){
		c[i][i]=c[i][0]=1;
	}
	
	for(int i=1;i<=1995;i++){
		for(int j=1;j<i;j++){
			c[i][j]=c[i-1][j-1]+c[i-1][j];
			c[i][j]%=mod;
		}
	}
	ll ans=0;
	
	for(int i=1;i<=min(n,(ll)1995);i++){
		for(int j=i+1;j<=min(n,(ll)1955);j++){
			ans+=c[a[i]+a[j]+b[i]+b[j]][a[i]+a[j]];
			ans%=mod;
		}
	}
	cout<<ans;
	
	return 0;
}