#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
    return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();



signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(4) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}
const int N = 2e5 + 10;
const int M = 1e9 + 7;

int pw(int a, int n = M - 2) {
    int ret = 1;
    while (n) {
        if (n & 1)
            ret = (ll) ret * a % M;
        a = (ll) a * a % M;
        n >>= 1;
    }
    return ret;
}

int parent[N];
int sz[N];
map<int, int> cnt[N];

vector<pii> a;

void make_set(int v) {
    parent[v] = v;
    sz[v] = 1;
    cnt[v][a[v].second]++;
}

int find_set(int v) {
    return v == parent[v] ? v : parent[v] = find_set(parent[v]);
}

void union_sets(int u, int v) {
    u = find_set(u);
    v = find_set(v);
    if (u == v)
        return;
    if ( sz[u] < sz[v])
        swap(u, v);
    sz[u] += sz[v];
    parent[v] = u;
    for (auto item : cnt[v]) {
        cnt[u][item.first] += item.second;
    }
}

void smain() {

    int n, x, y;
    cin >> n >> x >> y;
    a.resize(n);
    map<int, int> col;
    fori (i, n) {
        int c, w;
        cin >> c >> w;
        a[i] = {w, c};

    }
    sort(ALL(a));
    fori (i, n) {
        make_set(i);
    }
    vi first;
    fori (i, n) {
        if (a[i].second == a[0].second) {
            first.push_back(i);
        }
    }
    int cn = -1;
    fori (i, n) {
        if (col.count(a[i].second)) {
            int j = col[a[i].second];
            if (a[i].first + a[j].first <= x)
                union_sets(i, j);
        } else {
            col[a[i].second] = i;
        }
        if (a[i].second == a[0].second)
            continue;
        int l = -1, r = SZ(first);
        while (r - l > 1) {
            int m = r + l >> 1;
            int j = first[m];
            if (a[j].first + a[i].first <= y) {
                l = m;
            } else {
                r = m;
            }
        }
        inmax(cn, l);
        if (l != -1)
            union_sets(first[l], i);
    }

    for (int i = 1; i <= cn; ++i) {
        union_sets(first[i], first[i - 1]);
    }

    vl f(N, 1);
    int M = 1e9 + 7;
    for (int i = 1; i < N; ++i) {
        f[i] = f[i - 1] * i % M;
    }

    int ans = 1;
    fori (i, n) {
        if (parent[i] == i) {
            ans = (ll)ans * f[sz[i]] % M;
            for (auto item : cnt[i]) {
                ans = (ll) ans * pw(f[item.second]) % M;
            }
        }
    }
    cout << ans;
}

Measured memory_bytes: 46336