#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define eb emplace_back
const int N=2e5+5,up=5e6,M=up+5;
int n,m,c,tp,cnt[4],bc[20],z[N],z1[N],z2[N],o[N],bt[M];ll ans;
vector<int> a[N],b[N];tuple<int,int,int> ev[M];
int f(int x,int y)
{
	int t=a[x].size(),s=0;for(int i=1;i<=y;++i) s+=a[x][t-i];
	s+=(a[x].size()-y)*20;return s;
}
int f1(int x,int y) {int s=0;for(int i=0;i<y;++i) s+=a[x][i];return s;}
void upd(int x) {for(;x<=up;x+=x&-x) ++bt[x];}
int qry(int x) {int res=0;for(;x;x-=x&-x) res+=bt[x];return res;}
int id(int x) {return upper_bound(o+1,o+o[0]+1,x)-o-1;}
int main()
{
	scanf("%d %d %d",&n,&m,&c);
	for(int i=1,x,y;i<=n;++i) scanf("%d %d",&x,&y),a[x].eb(y);
	for(int i=1;i<=m;++i) sort(a[i].begin(),a[i].end());
	for(int i=1;i<=m;++i) ++cnt[min<int>(a[i].size(),3)];
	ans=1ll*cnt[3]*(cnt[2]+cnt[3]-1)*(cnt[1]+cnt[2]+cnt[3]-2);
	for(int i=1;i<=m;++i) if(!a[i].empty())
	{if(a[i].size()==1) z[++z[0]]=f(i,1);else z1[++z1[0]]=f(i,1);}
	sort(z+1,z+z[0]+1);sort(z1+1,z1+z1[0]+1);
	for(int i=1,t,t1;i<=m;++i) if(a[i].size()==1)
	{
		t=lower_bound(z+1,z+z[0]+1,f1(i,1))-z;
		t1=lower_bound(z1+1,z1+z1[0]+1,f1(i,1))-z1;
		ans+=1ll*(z[0]-t)*(cnt[2]+cnt[3])+1ll*(z1[0]-t1+1)*(cnt[2]+cnt[3]-1);
	}
	z[0]=z1[0]=z2[0]=0;
	for(int i=1;i<=m;++i) if(!a[i].empty())
	{if(a[i].size()==2) z[++z[0]]=f(i,1),z2[++z2[0]]=f1(i,2);else z1[++z1[0]]=f(i,1);}
	sort(z+1,z+z[0]+1);sort(z1+1,z1+z1[0]+1);sort(z2+1,z2+z2[0]+1);
	for(int i=1,t,t1,t2;i<=m;++i) if(a[i].size()>1)
	{
		bool fl=a[i].size()==2;
		t=lower_bound(z+1,z+z[0]+1,f1(i,1))-z;
		t1=lower_bound(z1+1,z1+z1[0]+1,f1(i,1))-z1;
		t2=upper_bound(z2+1,z2+z2[0]+1,f(i,2))-z2-1;
		ans+=1ll*(z[0]-t-fl+1)*(cnt[2]-fl-1)+1ll*(z1[0]-t1+fl)*(cnt[2]-fl);
		ans+=1ll*(t+t1-2)*(t2-fl);
	}
	for(int i=1;i<=m;++i) if(a[i].size()>1) ev[++tp]={f(i,2),f1(i,1),0};
	for(int i=1;i<=m;++i) if(a[i].size()==2) ev[++tp]={f1(i,2),f(i,1),1};
	sort(ev+1,ev+tp+1);
	for(int i=1;i<=tp;++i)
	{auto [x,y,op]=ev[i];if(op) upd(y);else ans-=qry(y-1);}
	z[0]=z1[0]=z2[0]=0;
	for(int i=1;i<=m;++i) if(!a[i].empty())
	{z[++z[0]]=f(i,1);if(a[i].size()==1) z1[++z1[0]]=f1(i,1);}
	sort(z+1,z+z[0]+1);sort(z1+1,z1+z1[0]+1);
	fill(bt,bt+up+1,0);tp=0;
	for(int i=1;i<=m;++i) if(a[i].size()==1) o[++o[0]]=f1(i,1);
	sort(o+1,o+o[0]+1);o[0]=unique(o+1,o+o[0]+1)-o-1;
	for(int i=1,x,x1,t,t1;i<=m;++i) if(!a[i].empty())
	{
		bool fl=a[i].size()==1;
		if(1ll*a[i].size()*(a[i].size()+1)/2<=o[0])
		{
			for(int j=0;j<a[i].size();++j) for(int k=0;k<=j;++k)
				b[i].eb(a[i][j]+k*20);
		}
		else
		{
			fill(bc,bc+20,0);b[i]=a[i];
			for(int j=1,l=0,r=0;j<=o[0];++j)
			{
				while(r<a[i].size() && a[i][r]<=o[j]) ++bc[a[i][r]%20],++r;
				while(l<a[i].size() && a[i][l]+l*20<o[j]) --bc[a[i][l]%20],++l;
				if(l<r) for(int k=0;k<20;++k) if(bc[(o[j]+k)%20]) {b[i].eb(o[j]+k);break;}
			}
		}
		sort(b[i].begin(),b[i].end());
		for(int j=0;j<b[i].size();++j)
		{
			x=b[i][j];ev[++tp]={-x,id(x)+1,-1};
			t=lower_bound(z+1,z+z[0]+1,x)-z;
			t1=upper_bound(z1+1,z1+z1[0]+1,x)-z1-1;ans+=1ll*(z[0]-t)*(t1-fl);
			if(j+1<b[i].size())
			{
				x1=b[i][j+1];ev[++tp]={-x1,id(x)+1,1};
				t=lower_bound(z+1,z+z[0]+1,x1)-z;ans-=1ll*(z[0]-t)*(t1-fl);
			}
		}
	}
	for(int i=1;i<=m;++i) if(a[i].size()==1) ev[++tp]={-f(i,1),id(f1(i,1)),0};
	sort(ev+1,ev+tp+1);
	for(int i=1;i<=tp;++i)
	{auto [x,y,op]=ev[i];if(op) ans+=qry(y-1)*op;else upd(y);}
	ans+=cnt[1];printf("%lld\n",ans);return 0;
}