// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 2e5 + 5;
const int MOD = 1e9 + 7;

int N, X, Y;
vector<int> A[MAXN];

void input()
{
    read(N); read(X); read(Y);
    for (int i = 1; i <= N; ++i) {
        int c, w;
        read(c); read(w);
        A[c].push_back(w);
    }
}

int fpm(LL base, LL exp)
{
    LL ret = 1;
    for (; exp; exp >>= 1) {
        if (exp & 1)
            (ret *= base) %= MOD;
        (base *= base) %= MOD;
    }
    return ret;
}

void solve()
{
    static int bnd[MAXN];
    int minfr = 0, secfr = 0;

    A[0].push_back(+oo);
    for (int i = 1; i <= N; ++i) {
        if (SZ(A[i])) {
            std::sort(ALL(A[i]));
            if (A[i][0] + A[i][1] <= X)
                bnd[i] = int(std::upper_bound(ALL(A[i]), X - A[i][0]) - A[i].begin() - 1);
            if (A[secfr][0] > A[i][0]) {
                secfr = i;
                if (A[minfr][0] > A[secfr][0])
                    std::swap(minfr, secfr);
            }
        }
    }

    static bool flag[MAXN];

    for (int i = 1; i <= N; ++i) {
        if (SZ(A[i])) {
            int t = (minfr == i ? secfr : minfr);
            if (A[i][0] + A[t][0] <= Y) {
                flag[i] = true;
                chkmax(bnd[i], int(std::upper_bound(ALL(A[i]), Y - A[t][0]) - A[i].begin() - 1));
            }
        }
    }

    static LL fac[MAXN], ifac[MAXN];

    fac[0] = 1;
    for (int i = 1; i <= N; ++i) fac[i] = fac[i-1] * i % MOD;
    ifac[N] = fpm(fac[N], MOD - 2);
    for (int i = N; i >= 1; --i) ifac[i-1] = ifac[i] * i % MOD;

    LL ans = 1;
    LL allcnt = 0, allcoef = 1;
    for (int i = 1; i <= N; ++i) {
        if (SZ(A[i])) {
            if (flag[i]) {
                allcnt += bnd[i] + 1;
                (allcoef *= ifac[bnd[i] + 1]) %= MOD;
            }
        }
    }
    (ans *= fac[allcnt]) %= MOD;
    (ans *= allcoef) %= MOD;

    printf("%lld\n", ans);
}

int main()
{
#ifdef __DEBUG
    freopen("D.in", "r", stdin);
    freopen("D.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// 当路谁相假，知音世所稀。
//     -- 孟浩然《留别王侍御维 / 留别王维》


Measured memory_bytes: 13440