# include <iostream>
# include <algorithm>
#include <array>
# include <cassert>
#include <cctype>
#include <climits>
#include <numeric>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <chrono>
# include <random>
# include <limits.h>
# include <unordered_map>
# include <unordered_set>
# include <deque>
# include <cstdio>
# include <cstring>
#include <stdio.h>
#include<time.h>
#include <stdlib.h>
#include <cstdint>
#include <cfenv>
#include<fstream>
//#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
long long MOD = 1000000000 + 7;// 998244353;
constexpr long long INF = numeric_limits<LL>::max() / 2;
const double PI = acos(-1);
#define fir first
#define sec second
#define thi third
#define debug(x) cerr<<#x<<": "<<x<<'\n'
typedef pair<LL, LL> Pll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll { LL first, second, third; };
struct Fll { LL first, second, third, fourd; };
typedef pair<LL, Tll> Ptll;
#define rep(i,rept) for(LL i=0;i<rept;i++)
#define Rrep(i,mf) for(LL i=mf-1;i>=0;i--)
void YN(bool f) {
	if (f)
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
}
void yn(bool f) {
	if (f)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
}
struct Edge { LL to, cost; };
struct edge { LL from, to, cost; };
vector<vector<LL>>g;
vector<edge>edges;
vector<LL>v;
map<LL, LL>ma;
set<Pll>st;
LL h, w, n, m, k, t, s, p, q, last, cnt, sum[210000], ans, dp[210000], a[210000], b[210000];
string str, ss;
bool f;
char c;
vector<Pll>V[210000];
struct Combination {
	int mod;
	vector< int64_t > mfact, rfact;

	Combination(int sz, int mod) : mfact(sz + 1), rfact(sz + 1), mod(mod) {
		mfact[0] = 1;
		for (int i = 1; i < mfact.size(); i++) {
			mfact[i] = mfact[i - 1] * i % mod;
		}
		rfact[sz] = inv(mfact[sz]);
		for (int i = sz - 1; i >= 0; i--) {
			rfact[i] = rfact[i + 1] * (i + 1) % mod;
		}
	}

	int64_t fact(int k) const {
		return (mfact[k]);
	}

	int64_t pow(int64_t x, int64_t n) const {
		int64_t ret = 1;
		while (n > 0) {
			if (n & 1) (ret *= x) %= mod;
			(x *= x) %= mod;
			n >>= 1;
		}
		return (ret);
	}

	int64_t inv(int64_t x) const {
		return (pow(x, mod - 2));
	}

	int64_t P(int n, int r) const {
		if (r < 0 || n < r) return (0);
		return (mfact[n] * rfact[n - r] % mod);
	}

	int64_t C(int p, int q) const {
		if (q < 0 || p < q) return (0);
		return (mfact[p] * rfact[q] % mod * rfact[p - q] % mod);
	}

	int64_t H(int n, int r) const {
		if (n < 0 || r < 0) return (0);
		return (r == 0 ? 1 : C(n + r - 1, r));
	}
};
Combination comb(210000, MOD);
int main() {
	cin >> n >> s >> t;
	Pll mn[2];
	mn[0] = Pll(INF, -1);
	mn[1] = Pll(INF, -1);
	rep(i, n) {
		cin >> a[i] >> b[i];
		a[i]--;
		V[a[i]].push_back(Pll(b[i], i));
		if (mn[0].first >= b[i]) {
			Pll cur = mn[0];
			mn[0].first = b[i];
			mn[0].second = a[i];
			if (mn[0].second != cur.second)mn[1] = cur;
		}
		if (mn[1].first >= b[i]&&mn[0].second!=a[i]) {
			mn[1].first = b[i];
			mn[1].second = a[i];
		}
	}
	rep(i, n) {
		sort(V[i].begin(), V[i].end());
		rep(j, V[i].size()) {
			LL it = V[i][j].second;
			if (s >= V[i][0].first + V[i][j].first) {
				b[it] = V[i][0].first;
			}
			if (mn[0].second != i) {
				if (t >= b[it] + mn[0].first)sum[i]++, cnt++;
			}
			else {
				if (t >= b[it] + mn[1].first)sum[i]++, cnt++;
			}
		}
	}
	ans = 1;
	rep(i, n) {
		if (sum[i] > 0) {
			ans *= comb.C(cnt, sum[i]);
			ans %= MOD;
			cnt -= sum[i];
		}
	}
	cout << ans << endl;
	return 0;
}

Measured memory_bytes: 21248