#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define pb push_back
const int N=5e5+5,MAXA=1e6+5,inf=1e9,MOD=1e9+7;
pair<int,int> fsh[N];
vector<int> pos[N];
/*
* take stuff not seen
* in that case have segtree0 which consists of how many ways and remove all occurences of type x after u finish calculating it
* take stuff seen but cant eat u in that case update all type x in segtree1 to 1 and calculate how many ways (basically taking all type x)
*/
int seg[N*4][2],offset=1,m;
void update(int idx,int val,int type){
idx+=offset;
seg[idx][type]=val;
idx/=2;
while(idx>0){
seg[idx][type]=seg[idx*2][type]*seg[idx*2+1][type]%m;
idx/=2;
}
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int f,k; cin>>f>>k>>m;
for(int i=0;i<N*4;i++)seg[i][0]=seg[i][1]=1;
while(offset<=f)offset*=2;
for(int i=1;i<=f;i++)cin>>fsh[i].first>>fsh[i].second;
sort(fsh+1,fsh+f+1);
for(int i=1;i<=f;i++){
pos[fsh[i].second].pb(i);
}
for(int i=1;i<=f;i++){
if(pos[fsh[i].second].back()==i){
// cout<<fsh[i].second<<' '<<pos[fsh[i].second].size()+1<<endl;
update(fsh[i].second,pos[fsh[i].second].size()+1,0);
update(fsh[i].second,pos[fsh[i].second].size()+1,1);
}
}
// cout<<seg[1+offset][0]<<endl;
int in=f,ce=f,ans=0;
for(int i=f;i>=1;i--){
int length=fsh[i].first,color=fsh[i].second;
if(pos[color].back()!=i)continue;
// cout<<seg[color+offset][0]<<endl;
if(in==i){
update(color,seg[color+offset][0]-1,0);
update(color,seg[color+offset][1]-1,1);
in--;
}
while(in>0 && fsh[in].first*2>length){
if(seg[fsh[in].second+offset][0]>1)update(fsh[in].second,seg[fsh[in].second+offset][0]-1,0);
if(seg[fsh[in].second+offset][1]>1)update(fsh[in].second,seg[fsh[in].second+offset][1]-1,1);
in--;
}
int og=seg[color+offset][0];
update(color,og-1,0); //to prevent us picking maximum since we take care of that in seg1
ans=(ans+seg[1][0])%m;
// cout<<og<<' '<<ans<<endl;
update(color,1,0);
int last=pos[color].size()-1;
while(last>0 && length<2*fsh[pos[color][last]].first)last--;
if(length>=2*fsh[pos[color][last]].first)last++;
while(ce>i && fsh[ce].first>=fsh[pos[color][last]].first*2){
update(fsh[ce].second,1,1);
ce--;
}
og=seg[color+offset][1];
update(color,1,1);
ans=(ans+seg[1][1])%m;
update(color,og,1);
// cout<<ans<<endl;
}
cout<<ans;
}
