//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#include <immintrin.h>
#ifdef DEBUG
#include "./Lib/debug_VC.hpp"
#include "./Lib/Timer.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
signed pow(signed, signed) { assert(false); return -1; }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

/* constant value */
constexpr ll MOD = 1000000007;
//constexpr ll MOD = 998244353;

//=============================================================================================;

class ModCalculator {
	const long long m_mod;
	const std::vector<long long> m_fac;
	const std::vector<long long> m_finv;

	auto constructFac(long long s) {
		std::vector<long long> fac(s);
		fac[0] = fac[1] = 1;
		for (long long i = 2; i < s; ++i) {
			fac[i] = fac[i - 1] * i;
			if (fac[i] > m_mod) { fac[i] %= m_mod; }
		}
		return fac;
	}
	auto constructInv(long long s) {
		std::vector<long long> finv(s);
		finv[s - 1] = this->pow(m_fac[s - 1], m_mod - 2);
		for (long long i = s - 2; i >= 0; --i) {
			finv[i] = finv[i + 1] * (i + 1);
			if (finv[i] > m_mod) { finv[i] %= m_mod; }
		}
		return finv;
	}
public:
	ModCalculator(long long mod = MOD, long long size = 3 * 1e6) :
		m_mod(mod), m_fac(constructFac(size)), m_finv(constructInv(size)) {}

	long long pow(long long a, long long b) const {
		long long ans = 1;
		while (b > 0) {
			if (b & 1) { ans *= a; if (ans > m_mod) { ans %= m_mod; } }
			b >>= 1; a *= a; if (a > m_mod) { a %= m_mod; }
		}
		return ans;
	}

	auto C(int n, int r) const {
		long long val = m_fac[n] * m_finv[r];
		if (val > m_mod) { val %= m_mod; }
		val *= m_finv[n - r];;
		if (val > m_mod) { val %= m_mod; }
		return val;
	}
}calc;

class UnionFind {
	std::vector<ll> m_root;
	std::vector<ll> m_depth;
	std::vector<ll> m_size;
public:
	UnionFind(ll size_) : m_root(size_), m_depth(size_, 0), m_size(size_, 1) {
		std::iota(m_root.begin(), m_root.end(), 0);
	}
	void unite(ll x, ll y) {
		x = root(x);
		y = root(y);
		if (x == y) return;
		ll t = size(x) + size(y);
		m_size[x] = m_size[y] = t;
		if (m_depth[x] < m_depth[y]) m_root[x] = y;
		else m_root[y] = x;
		if (m_depth[x] == m_depth[y]) ++m_depth[x];
	}
	bool isSame(ll x, ll y) {
		return root(x) == root(y);
	}
	ll root(ll x) {
		if (m_root[x] == x) return x;
		return m_root[x] = root(m_root[x]);
	}
	ll size(ll x) {
		if (m_root[x] == x) return m_size[x];
		return size(m_root[x] = root(m_root[x]));
	}
};
signed main() {
	ll n, x, y;
	cin >> n >> x >> y;

	V<PAIR> v;
	v.reserve(n);

	REP(_, n) {
		ll a, b;
		cin >> a >> b;
		--a;
		v.emplace_back(a, b);
	}
	auto tree = UnionFind(n);
	{
		V<PAIR> mn(n, {-1,1e10});// c -> it, mn
		REP(i, n)if (chmin(mn[v[i].first].second, v[i].second)) {
			mn[v[i].first].first = i;
		};
		{
			REP(i, n)if (v[i].first > -1 &&
						 mn[v[i].first].second + v[i].second <= x) {
				tree.unite(i, mn[v[i].first].first);
			}
		}
	}
	{
		// it, mn
		PAIR p1{-1,1e10}, p2{-1,1e10};
		auto update = [&v](PAIR& p, const PAIR& nw) {
			if (p.first == -1) { p = nw; }
			if (v[p.first].first == v[nw.first].first) { false; }
			if (chmin(p.second, nw.second)) {
				p.first = nw.first;
				return true;
			}
			return false;
		};
		REP(i, n) {
			auto tmp = p1;
			if (update(p1, {i ,v[i].second})) {
				if (v[p1.first].first != v[tmp.first].first) {
					update(p2, tmp);
				}
			} else {
				update(p2, {i,v[i].second});
			}
		}
		REP(i, n) {
			auto& p = ((v[i].first == v[p1.first].first) ? p2 : p1);
			if (p.second + v[i].second <= y) { tree.unite(i, p.first); }
		}
	}

	constexpr ll mx = 1e6;
	VL frac(mx + 10, 1);
	VL frac_r(mx + 10, 1);

	FOR(i, 2, mx + 5) {
		frac[i] = frac[i - 1] * i;
		if (frac[i] >= MOD) { frac[i] %= MOD; }
		frac_r[i] = calc.pow(frac[i], MOD - 2);
	}

	// root -> c,n
	// root -> sum
	V<unordered_map<ll, ll>> vmp(n);
	VL sum(n);
	REP(i, n) {
		ll root = tree.root(i);
		++sum[root];
		vmp[root][v[i].first]++;
	}
	ll ans = 1;
	REP(i, n) {
		ans *= frac[sum[i]];
		if (ans >= MOD) { ans %= MOD; }
		REPC(p, vmp[i]) {
			ans *= frac_r[p.second];
			if (ans >= MOD) { ans %= MOD; }
		}
	}
	cout << ans << endl;
}

Measured memory_bytes: 95304