#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;


int N, X, Y, dp[5005][5005];
pii x[5005], y[5005];

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> N >> X >> Y;
    for (int i = 1; i <= N; i++)
    {
        cin >> x[i].F >> x[i].S;
        cin >> y[i].F >> y[i].S;
    }
    for (int i = 0; i <= N; i++)
        for (int j = 0; j <= N; j++)
            dp[i][j] = -1;
    dp[0][0] = 0;
    for (int i = 0; i < N; i++)
        for (int j = 0; j < N; j++)
            if (dp[i][j] >= 0)
            {
                if (x[i + 1].F <= X + j && X + j <= x[i + 1].S &&
                    y[i + 1].F <= Y + dp[i][j] && Y + dp[i][j] <= y[i + 1].S)
                    dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j]), 
                    dp[i + 1][j] = max(dp[i + 1][j], dp[i][j] + 1);
                else 
                    dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
            }
    int ans = 0;
    for (int j = 0; j <= N; j++)
        if (dp[N][j] >= 0)
            ans = max(ans, j + dp[N][j]);
    cout << ans << '\n';

}