#include<bits/stdc++.h>

using namespace std;

const int N = 5e3 + 5;

struct Node{
  int ax, ay, bx, by;
}s[N];

int n, a, b, dp[N][N];

int main(){
  cin >> n >> a >> b;
  for(int i = 1; i <= n; i++){
    cin >> s[i].ax >> s[i].ay >> s[i].bx >> s[i].by;
  }
  for(int i = 0; i <= n; i++){
    for(int j = 0; j <= n; j++) dp[i][j] = -N;
  }
  dp[0][0] = 0;
  for(int i = 1; i <= n; i++){
    for(int j = 0; j <= i; j++){
      dp[i][j] = max(dp[i][j], dp[i - 1][j]);
      int na = 0, nb = 0;
      na = a + j, nb = b + dp[i - 1][j] - j;
      if(na >= s[i].ax && na <= s[i].ay && nb >= s[i].bx && nb <= s[i].by){
        dp[i][j] = max(dp[i][j], dp[i - 1][j] + 1);
      }
      if(j){
        na = a + j - 1, nb = b + dp[i - 1][j - 1] - j + 1;
        if(na >= s[i].ax && na <= s[i].ay && nb >= s[i].bx && nb <= s[i].by){
          dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + 1);
        }
      }
    }
  }
  int ans = 0;
  for(int i = 0; i <= n; i++){
    ans = max(ans, dp[n][i]);
  }
  cout << ans;
  return 0;
}