#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <iomanip>
#include <complex>
#include <bitset>
#include <stack>
using namespace std;
 
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define repl(i,s,n) for(int i=s; i<=n; ++i)
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define ktya(x) sort(all(x))
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 1e18
#define INFLL 1000000000000000007LL
#define SIZE 200105
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define mind(a,b) (a>b?b:a)
#define maxd(a,b) (a>b?a:b)
#define PI (acos(-1))
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
typedef pair<int,ll> pill; typedef pair<ll,int> plli; 
typedef pair<double, int> pdi;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }
typedef complex<double> P;
ll MOD = 1000000007;
//ll MOD=998244353;
typedef ll Weight;
struct Edge {
	int src, dst;
	Weight weight;
};
bool operator < (const Edge &e, const Edge &f) {
	return e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!
	e.src != f.src ? e.src < f.src : e.dst < f.dst;
}
typedef vector<Edge> Edges;
int N;
ll X,Y;
vector<pair<int, ll> > data2;
struct UnionFind {
	vector<int> data;
	void init(int n) { data.assign(n, -1); }
	bool unionSet(int x, int y) {
		x = root(x); y = root(y);
		if(x != y) {
			if(data[y] < data[x]) swap(x, y);
			data[x] += data[y]; data[y] = x;
		}
		return x != y;
	}
	bool findSet(int x, int y) { return root(x) == root(y); }
	int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
	int size(int x) { return -data[root(x)]; }
}uf;
ll bik[214514];
ll bikinv[214514];
ll gcd(ll a, ll b) {
	return b != 0 ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
	return a * b / gcd(a, b);
}
// a x + b y = gcd(a, b)
ll extgcd(ll a, ll b, ll &x, ll &y) {
	ll g = a; x = 1; y = 0;
	if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x;
	return g;
}
ll invMod(ll a, ll m) {
	ll x, y;
	if (extgcd(a, m, x, y) == 1) return (x + m) % m;
	else                         return 0; // unsolvable
}
void bikcal(int NN){
	ll hoge=(ll)1;
	bik[0]=(ll)1;
	bikinv[0]=(ll)1;
	for(int i=1;i<=NN;i++){
		hoge=(hoge*i)%MOD;
		bik[i]=hoge;
		bikinv[i]=invMod(bik[i],MOD);
	}
}


ll Comb(int a,int b){
	ll ret;
	ret=(((bik[a]*bikinv[b])%MOD)*bikinv[a-b])%MOD;
	return ret;
}


ll powMod(ll x, ll k, ll m) {//x^k (mod n)
	if (k == 0)     return 1;
	if (k % 2 == 0) return powMod(x*x % m, k/2, m);
	else            return x*powMod(x, k-1, m) % m;
}
bool used[214514];
vi colp[214514];
int minmemo[214514];
int main(){
	cin>>N>>X>>Y;
	uf.init(N);
	bikcal(N+1);
	rep(i,N)used[i]=false;
	rep(i,N){
		ll c,w;
		cin>>c>>w;c--;
		data2.pb(mp(w,c));
	}
	sort(all(data2));
	ll cos0=data2[0].first;
	int col0=data2[0].second;
	int col2;
	int col2za=N+1;
	int num=0;
	
	rep(i,N){
		int col=data2[i].second;
		if(!used[col]){
			used[col]=true;
			minmemo[col]=data2[i].first;
			num++;
			if(col!=col0&&col2za==N+1){
				col2=col;
				col2za=i;
			}
		}
		colp[col].pb(i);
	}
	rep(col,N){
		if(used[col]){
			rep(j,colp[col].size()){
				int now=colp[col][j];
				if(data2[now].first+minmemo[col]<=X)uf.unionSet(now,colp[col][0]);
			}
		}
	}
	if(num>1){
		rep(col,N){
			if(used[col]){
				rep(j,colp[col].size()){
					int now=colp[col][j];
					ll cos = data2[now].first;
					if(col==col0){
						if(cos+minmemo[col2]<=Y)uf.unionSet(now,col2za);
					}else{
						if(cos+minmemo[col0]<=Y)uf.unionSet(now,0);
					}
				}
			}
		}
	}
	vi roots[214514];
	rep(i,N){
		roots[uf.root(i)].pb(i);
	}
	/*cout<<endl;
	rep(i,N){
		cout<<data2[i].first<<" "<<data2[i].second<<endl;
	}*/
	/*rep(i,N){
		rep(j,roots[i].size()){
			cout<<roots[i][j]<<" ";
		}
		cout<<endl;
	}*/
	ll ans=1;
	rep(i,N){
		if(uf.root(i)==i){
			
			map<int,int> cnts;
			rep(j,roots[i].size()){
				int now=roots[i][j];
				cnts[data2[now].second]++;
				//cout<<data2[now].second<<" ";
			}
			ll temp=bik[roots[i].size()];
			for(auto i=cnts.begin();i!=cnts.end();++i){
				temp*=bikinv[i->second];
				temp%=MOD;
				//cout<<(i->first)<<" "<<(i->second)<<endl;
			}
			ans*=temp;
			ans%=MOD;
			//cout<<ans<<endl;
		}
	}
	cout<<ans<<endl;
}


Measured memory_bytes: 30700