//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
//#pragma GCC optimize("Ofast,fast-math")
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef double db;
#define F(i, a, b) for(int i = a; i <= (b); ++i)
#define F2(i, a, b) for(int i = a; i < (b); ++i)
#define dF(i, a, b) for(int i = a; i >= (b); --i)
template<typename T> void debug(string s, T x) {
	cerr << "[" << s << "] = [" << x << "]\n";
}
template<typename T, typename... Args> void debug(string s, T x, Args... args) {
	for (int i = 0, b = 0; i < (int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++;
	else if (s[i] == ')' || s[i] == '}') b--;
	else if (s[i] == ',' && b == 0) {
		cerr << "[" << s.substr(0, i) << "] = [" << x << "] | ";
		debug(s.substr(s.find_first_not_of(' ', i + 1)), args...);
		break;
	}
}
#ifdef ONLINE_JUDGE
#define Debug(...)
#else
#define Debug(...) debug(#__VA_ARGS__, __VA_ARGS__)
#endif
#define pb push_back
#define fi first
#define se second
#define Mry fprintf(stderr, "%.3lf MB\n", (&Med - &Mbe) / 1048576.0)
#define Try cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
typedef long long ll;
// namespace Fread {const int SIZE = 1 << 17; char buf[SIZE], *S, *T; inline char getchar() {if (S == T) {T = (S = buf) + fread(buf, 1, SIZE, stdin); if (S == T) return '\n';} return *S++;}}
// namespace Fwrite {const int SIZE = 1 << 17; char buf[SIZE], *S = buf, *T = buf + SIZE; inline void flush() {fwrite(buf, 1, S - buf, stdout), S = buf;} inline void putchar(char c) {*S++ = c;if (S == T) flush();} struct NTR {~NTR() {flush();}} ztr;}
// #ifdef ONLINE_JUDGE
// #define getchar Fread::getchar
// #define putchar Fwrite::putchar
// #endif
inline int ri() {
	int x = 0;
	bool t = 0;
	char c = getchar();
	while (c < '0' || c > '9') t |= c == '-', c = getchar();
	while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
	return t ? -x : x;
}
inline void wi(int x) {
	if (x < 0) {
		putchar('-'), x = -x;
	}
	if (x > 9) wi(x / 10);
	putchar(x % 10 + 48);
}
inline void wi(int x, char s) {
	wi(x), putchar(s);
}
bool Mbe;
// mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll infll = 0x3f3f3f3f3f3f3f3f;
const int _ = 2e5 + 5;

int n, f[5005][5005];

pii a[_], b[_];

set<int> g[_];

bool Med;
signed main() {
	// Mry;
	freopen("1.txt", "r", stdin);
	n = ri();
	int s1 = ri(), s2 = ri();
	F(i, 1, n) a[i].fi = ri(), a[i].se = ri(), b[i].fi = ri(), b[i].se = ri();
	F(i, 0, n + 1) F(j, 0, n + 1) f[i][j] = -infll;
	f[0][0] = 0;
	g[0].insert(0);
	F(i, 1, n) {
		set<pii> cz;
		F(j, 0, i - 1) {
//			f[j][i] = max(f[j][i], f[j][i - 1]);
//			if(f[j][i - 1] == -infll) continue;
			if(j + s1 >= a[i].fi && j + s1 <= a[i].se) {
				int l = b[i].fi - s2 + j, r = b[i].se - s2 + j;
				if(l > r || g[j].empty()) continue;
				auto P = g[j].lower_bound(l);
				if(P != g[j].end() && *P >= l && *P <= r) {
					cz.insert({j, *P + 1});
					cz.insert({j + 1, *P + 1});
					Debug("1ha", j, *P + 1);
					P++;
				}
				P = g[j + 1].lower_bound(l);
				if(P != g[j + 1].end() && *P >= l && *P <= r) {
					if(g[j].lower_bound(*P) != g[j].end()) {
						cz.insert({j + 1, *P + 1});
					}
					P++;
				}
//				if(p >= l && p <= r) {
//					bool flg = 0;
//					for(pii v : cz) if((v.fi == j && v.se == p + 1) || g[v.fi].find(v.se) != g[v.fi].end()) {
//						flg = 1;
//						break;
//					} 
//					Debug(j, p + 1, flg);
//					cz.pb({j, p + 1});
//					cz.pb({j + 1, p + 1});
//					f[j][i] = max(f[j][i], p + 1);
//					f[j + 1][i] = max(f[j + 1][i], p + 1);
//				}
			}
//			assert(f[j][i] >= f[j][i - 1]);
		}
		for(pii v : cz) g[v.fi].insert(v.se);
//		F(j, 0, i) g[j].insert(f[j][i]);
		Debug(i, f[0][i], f[1][i], f[2][i]);
	}
	int ans = -infll;
	F(i, 0, n) if(!g[i].empty()) ans = max(ans, *prev(g[i].end()));
	cout << ans <<'\n';
	// Try;
	return 0;
}

/*
17 716580777 76836128
716580777 716580777 76836128 76836128
716580777 716580777 76836129 76836129
716580777 716580777 76836130 76836130
716580777 716580777 76836131 76836131
716580778 716580778 76836131 76836131
716580779 716580779 76836131 76836131
716580780 716580780 76836131 76836131
716580778 716580778 76836128 76836128
716580778 716580778 76836129 76836129
716580779 716580779 76836129 76836129
716580780 716580780 76836129 76836129
716580780 716580780 76836130 76836130
716580780 716580780 76836131 76836131
716580780 716580780 76836132 76836132
716580781 716580781 76836132 76836132
716580781 716580781 76836133 76836133
716580781 716580781 76836134 76836134

6 76836128 716580777
76836128 76836128 716580777 716580777
76836129 76836129 716580777 716580777
76836130 76836130 716580777 716580777
76836131 76836131 716580777 716580777
76836131 76836131 716580778 716580778
76836131 76836131 716580779 716580779

1007 716580777 76836128
716580777 716580777 76836128 76836128
716580777 716580777 76836129 76836129
716580777 716580777 76836130 76836130
716580777 716580777 76836131 76836131
716580778 716580778 76836131 76836131
716580779 716580779 76836131 76836131
716580780 716580780 76836131 76836131
*/