#define _GLIBCXX_IOSTREAM
#include<bits/stdc++.h>

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double llf;
typedef std::pair<int,int> pii;

#define xx first
#define yy second

template<typename T> inline T max(T a,T b){return a>b?a:b;}
template<typename T> inline T min(T a,T b){return a<b?a:b;}
template<typename T> inline T abs(T a){return a>0?a:-a;}
template<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}
template<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}
template<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}
template<typename T> inline T sqr(T x){return x*x;}
#define mp(a,b) std::make_pair(a,b)
#define pb push_back
#define I inline
#define mset(a,b) memset(a,b,sizeof(a))
#define mcpy(a,b) memcpy(a,b,sizeof(a))

#define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)
#define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)
#define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define fd0(i,n) for(int i=(n)-1;~i;i--)
#define fd1(i,n) for(int i=n;i;i--)
#define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define foe(i,x)for(__typeof(x.end())i=x.begin();i!=x.end();++i)

struct Cg{I char operator()(){return getchar();}};
struct Cp{I void operator()(char x){putchar(x);}};
#define OP operator
#define RT return *this;
#define RX x=0;char t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\
if(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x
#define RU x=0;char t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define TR *this,x;return x;
I bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int &x)
{RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char &x)
{for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char *x){char t=P();for(;IS(t);t=P());if(~t){
for(;!IS(t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf &x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf &x){RX;RL;RT}I OP llf(){llf x;TR}
I Fr&OP,(uint &x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull &x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;
#define WI(S) if(x){if(x<0)P('-'),x=-x;char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
#define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)x=-x;\
while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);
#define WU(S) if(x){char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
template<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}
I Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}
I Fw&OP()(ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char *x){while(*x)P(*x++);RT}
I Fw&OP()(const char *x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;

const int N=200007,P=1000000007;

int fa[N],co[N],cnt[N];
std::vector<pii>cl[N];
pii gg[N];
std::vector<int>f[N];

inline int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
inline void merge(int x,int y){/*out,"merge:",x,' ',y,'\n';*/if(find(x)^find(y))fa[fa[x]]=fa[y];}

int inv[N];

int main()
{
	int n,x,y,a,b;
	in,n,x,y;
	inv[1]=1;
	fo(i,2,n)inv[i]=(ll)inv[P%i]*(P-P/i)%P;
	fo1(i,n)
	{
		in,b,a;co[i]=b;
		gg[i]=mp(a,i);
		cl[b].pb(mp(a,i));
	}
	fo1(i,n)fa[i]=i;
	std::sort(gg+1,gg+n+1);
	if(n<3)
	{
		fo1(i,n)fo1(j,n)if(co[gg[i].yy]!=co[gg[j].yy]&&gg[i].xx+gg[j].xx<=y)
			merge(gg[i].yy,gg[j].yy);
	}
	else
	{
		int a[3],b[3],cnt=1;
		a[0]=gg[1].yy,b[0]=gg[1].xx;
		fo1(i,n)if(co[gg[i].yy]!=co[a[0]]){a[1]=gg[i].yy,b[1]=gg[i].xx,cnt++;break;}
		if(cnt>1){fo1(i,n)if(co[gg[i].yy]!=co[a[0]]&&co[gg[i].yy]!=co[a[1]]){a[2]=gg[i].yy,b[2]=gg[i].xx,cnt++;break;}}
		fo1(i,n)fo0(j,cnt)if(co[gg[i].yy]!=co[a[j]]&&gg[i].xx+b[j]<=y)
			merge(gg[i].yy,a[j]);
	}
	//out,"ok\n";
	fo1(i,n)if(cl[i].size())
	{
		int lim=x;
		std::sort(cl[i].begin(),cl[i].end());
		foe(j,cl[i])if(j->xx+cl[i][0].xx<=lim)merge(cl[i][0].yy,j->yy);
	}
	fo1(i,n)f[find(i)].pb(i);
	int ans=1;
	fo1(i,n)if(find(i)==i)
	{
		//out,'*',f[i].size(),'\n';
		fo1(j,f[i].size())ans=(ll)ans*j%P;
		fo0(j,f[i].size())cnt[co[f[i][j]]]++;
		fo0(j,f[i].size())if(cnt[co[f[i][j]]])
		{
			//out,'/',cnt[co[f[i][j]]],'\n';
			fo1(k,cnt[co[f[i][j]]])ans=(ll)ans*inv[k]%P;
			cnt[co[f[i][j]]]=0;
		}
	}
	out,ans;
}

Measured memory_bytes: 24320