#include<bits/stdc++.h>
#define int long long
#define f first
#define s second
#define pii pair<int,int>
using namespace std;
const int N = 5e5 + 5; // !
int tree[4 * N], mx[N], act[N], cnt[N], n, t, mod, f[N], aft[N], last[N];
vector<int> occ[N];
pii p[N];
void upd(int u,int id, int l, int r, int val) {
if(l > id || r < id) return;
if(l == r) {
tree[u] += val + mod;
tree[u] %= mod;
return;
}
int mid = (l + r) / 2;
upd(2 * u, id, l, mid, val); upd(2 * u + 1, id, mid + 1, r, val);
tree[u] = tree[2 * u] * tree[2 * u + 1] % mod;
}
int get(int u,int st,int en, int l,int r) {
if(l > en || r < st) return 1;
if(st <= l && r <= en) return tree[u];
int mid = (l + r) / 2;
return get(2 * u, st, en, l, mid) * get(2 * u + 1, st,en ,mid + 1, r) % mod;
}
int get(int c,int val) {
int l = 0, r = occ[c].size(), P = -1; r--;
while(l <= r) {
int mid = (l + r) / 2;
if(p[occ[c][mid]].f * 2 > val) r = mid - 1;
else l = mid + 1, P = mid;
}
return P;
}
main(){
cin >> n >> t >> mod;
for(int i = 1; i <= n; i++) upd(1, i, 1 ,n, 1);
for(int i = 1; i <= n; i++) {
cin >> p[i].f >> p[i].s;
}
sort(p + 1, p + n + 1);
for(int i = 1; i <= n; i++) {
int c = p[i].s;
mx[p[i].s] = max(mx[p[i].s], i);
}
for(int i = 1; i <= n; i++) {
occ[p[i].s].push_back(i);
}
int L = 0, ans = 0, L1 = 0;
for(int i = 1; i <= n; i++) {
if(mx[p[i].s] != i) continue;
while(L1 < i && p[L1 + 1].f * 2 <= p[i].f) {
L1++;
int c = p[L1].s;
upd(1, mx[c], 1, n, 1);
cnt[c]++;
}
int c = p[i].s;
int x = occ[c][cnt[c]];
int l = i, r = n, pos = i;
while(l <= r) {
int mid = (l + r) / 2;
if(p[x].f * 2 > p[mid].f) pos = mid, l = mid + 1;
else r = mid - 1;
}
ans += get(1, 1, i - 1, 1, n) * get(1, i + 1, pos, 1, n) % mod;
}
for(int i = 1; i <= t; i++) upd(1, mx[i] ,1, n, -cnt[i]), cnt[i] = 0, act[i] = 0;
L1 = 0;
for(int i = 1; i <= n; i++) {
if(mx[p[i].s] == i) act[p[i].s] = 1, upd(1, p[i].s, 1, t, cnt[p[i].s]);
while(L1 < i && p[L1 + 1].f * 2 <= p[i].f) {
L1++;
int c = p[L1].s;
if(act[c]) upd(1, c, 1, t, 1);
cnt[c]++;
}
int c = p[i].s;
if(!act[c]) continue;
ans += get(1, 1, c - 1, 1, t) * get(1, c + 1, t, 1, t) % mod * (cnt[c]) % mod;
ans %= mod;
}
cout << ans;
}
