//start of jonathanirvings' template v3.0.3 (BETA)

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef pair<string,string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<LL> vl;
typedef vector<vl> vvl;

double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
double PI = acos(-1);
int dirx[8] = {-1,0,0,1,-1,-1,1,1};
int diry[8] = {0,1,-1,0,-1,1,-1,1};

#ifdef TESTING
  #define DEBUG fprintf(stderr,"====TESTING====\n")
  #define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
  #define debug(...) fprintf(stderr, __VA_ARGS__)
#else
  #define DEBUG 
  #define VALUE(x)
  #define debug(...)
#endif

#define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
#define FORN(a,b,c) for (int (a)=(b);(a)<=(c);++(a))
#define FORD(a,b,c) for (int (a)=(b);(a)>=(c);--(a))
#define FORSQ(a,b,c) for (int (a)=(b);(a)*(a)<=(c);++(a))
#define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))
#define FOREACH(a,b) for (auto &(a) : (b))
#define REP(i,n) FOR(i,0,n)
#define REPN(i,n) FORN(i,1,n)
#define MAX(a,b) a = max(a,b)
#define MIN(a,b) a = min(a,b)
#define SQR(x) ((LL)(x) * (x))
#define RESET(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(),v.end()
#define ALLA(arr,sz) arr,arr+sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr,sz) sort(ALLA(arr,sz))
#define REVERSEA(arr,sz) reverse(ALLA(arr,sz))
#define PERMUTE next_permutation
#define TC(t) while(t--)

inline string IntToString(LL a){
  char x[100];
  sprintf(x,"%lld",a); string s = x;
  return s;
}

inline LL StringToInt(string a){
  char x[100]; LL res;
  strcpy(x,a.c_str()); sscanf(x,"%lld",&res);
  return res;
}

inline string GetString(void){
  char x[1000005];
  scanf("%s",x); string s = x;
  return s;
}

inline string uppercase(string s){
  int n = SIZE(s); 
  REP(i,n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
  return s;
}

inline string lowercase(string s){
  int n = SIZE(s); 
  REP(i,n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
  return s;
}

inline void OPEN (string s) {
  #ifndef TESTING
  freopen ((s + ".in").c_str (), "r", stdin);
  freopen ((s + ".out").c_str (), "w", stdout);
  #endif
}

//end of jonathanirvings' template v3.0.3 (BETA)

LL MOD = 1e9 + 7;
LL f[200005];
LL invf[200005];
vi warna;
int c[200005],w[200005];
int n,x,y,m;
int ix[200005];
vi minw;
vi isi[200005];
int ada[200005];
bool gabung[200005];

LL p(LL a, LL b)
{
  if (b == 0) return 1;
  if (b == 1) return a % MOD;
  LL tmp = SQR(p(a,b/2)) % MOD;
  if (b % 2 == 0) return tmp;
  return (tmp * a) % MOD;
}

int main()
{
  f[0] = 1;
  FORN(i,1,200000) f[i] = (f[i-1] * i) % MOD;
  invf[200000] = p(f[200000],MOD-2);
  FORD(i,199999,0) invf[i] = invf[i+1] * (i+1) % MOD;
  scanf("%d %d %d",&n,&x,&y);
  REP(i,n)
  {
    scanf("%d %d",&c[i],&w[i]);
    warna.pb(c[i]);
  }
  SORT(warna);
  warna.erase(unique(ALL(warna)),warna.end());
  REP(i,SIZE(warna)) ix[warna[i]] = i;
  m = SIZE(warna);
  REP(i,n) c[i] = ix[c[i]];
  REP(i,n)
  {
    isi[c[i]].pb(w[i]);
  }
  REP(i,m) 
  {
    SORT(isi[i]);
    minw.pb(isi[i][0]);
  }
  SORT(minw);
  LL risan = 1;
  int total = 0;
  REP(i,m)
  {
    int sampai = 0;
    REP(j,SIZE(isi[i])) 
    {
      if (isi[i][j] + isi[i][0] > x) break;
      MAX(sampai,j);
    }
    if (m > 1)
    {
      int batas = (isi[i][0] == minw[0] ? minw[1] : minw[0]);
      if (batas + isi[i][0] <= y) gabung[i] = 1;
      REP(j,SIZE(isi[i]))
      {
        if (batas + isi[i][j] > y) break;
        MAX(sampai,j);
      }
    }
    if (gabung[i])
    {
      total += sampai + 1;
      risan = risan * invf[sampai + 1] % MOD;
    }
    // VALUE(sampai);
    // VALUE(gabung[i]);
  }
  risan = risan * f[total] % MOD;
  printf("%lld\n",risan);
  return 0;
}










Measured memory_bytes: 17140