#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P, ll> T;
 
long long int INF = 1e18;
const ll fact_table = 800008;
double Pi = 3.1415926535897932384626;

priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
// priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
ll dx[8]={1,0,-1,0,1,1,-1,-1};
ll dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//↓,→,↑,←
 
 
#define p(x) cout<<x<<"\n";
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
// #define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
#define pc(x) cout << x << ",";
 
 
// ll mod = 998244353;
 ll mod = 1000000007;
  
ll mypow(ll number1,ll number2, ll mod){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = mypow(number1,number2 / 2, mod);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll rui(ll number1,ll number2){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
 
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
 
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
 
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}
 

ll fact[fact_table + 5],rfact[fact_table + 5];
 
 
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = rui(fact[fact_table],mod - 2);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}


ll n,m,num,sum,a,b,d,e,h,r,l,q;
ll k;
ll c[200005], w[500005];
vector<ll> G[500005];
// ll x[500005], y[500005], z[500005];
char s[500005], t[500005];
ll size[5005];
ll min_w[500005];
int main(){
    ll x, y;
    c3_init();
    cin >> n >> x >> y;
    vector<P> color;
    for(ll i=1;i<=n;i++){
        min_w[i] = INF;
    }
    for(ll i=0;i<n;i++){
        cin >> c[i] >> w[i];
        G[c[i]].pb(w[i]);
        min_w[c[i]] = min(min_w[c[i]], w[i]);
    }
    for(ll i=1;i<=n;i++){
        if(min_w[i] == INF)continue;
        color.pb(P(min_w[i], i));
    }
    sort(color.begin(), color.end());
    
    if(color.size() == 1){
        p(1);
        return 0;
    }else if(color[0].first + color[1].first > y){
        p(1);
        return 0;
    }
    vector<ll> final;
    for(ll i=1;i<color.size();i++){
        ll c = color[i].second;
        if(color[i].first + color[0].first > y)continue;
        ll ok = 0, ng = G[c].size();

        sort(G[c].begin(), G[c].end());
        while(ng - ok > 1){
            ll mid = (ng + ok) / 2;
            if(G[c][mid] + G[c][0] <= x || G[c][mid] + color[0].first <= y){
                ok = mid;
            }else{
                ng = mid;
            }
        }
        final.pb(ok + 1);
    }
    ll c = color[0].second;
    sort(G[c].begin(), G[c].end());
    ll ok = 0, ng = G[c].size();
    while(ng - ok > 1){
        ll mid = (ng + ok) / 2;
        if(G[c][mid] + G[c][0] <= x || G[c][mid] + color[1].first <= y){
            ok = mid;
        }else{
            ng = mid;
        }
    }
    final.pb(ok + 1);
    ll size = 0ll;
    for(ll i=0;i<final.size();i++){
        size += final[i];
    }
    ll ans = fact[size];
    for(ll i=0;i<final.size();i++){
        ans *= rfact[final[i]];
        ans %= mod;
    }
    p(ans);
    
    return 0;
}


















Measured memory_bytes: 40820