#include <bits/stdc++.h>

const int N = 5e3 + 5;

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

int main () {
    std::cin >> n >> a >> b;
    f[0][0] = 1;
    for (int al, ar, bl, br, p = 1; p <= n; p++) {
        std::cin >> al >> ar >> bl >> br;
        for (int i = std::max(0, al - a); i <= std::min(p, ar - a); i++)
            for (int j = std::max(0, bl - b); j <= std::min(p, br - b); j++)
                f[i + 1][j] |= f[i][j], f[i][j + 1] |= f[i][j];
    }
    int ans = 0;
    for (int i = 0; i <= n; i++)
        for (int j = 0; j <= n; j++)
            ans = std::max(ans, f[i][j] * (i + j));
    // std::cout << ans << "\n";
    // if (ans != 4997) std::cout << ans << "\n";
    // else {
    //     int max = 0, pi, pj;
    //     for (int i = 0; i <= n; i++)
    //         for (int j = 0; j <= n; j++)
    //             if (f[i][j] * (i + j) > max)
    //                 max = f[i][j] * (i + j), pi = i, pj = j;
    //     std::cout << pi << " " << pj << "\n";
    // }
    for (int j = 0; j <= 4997; j++) assert(f[0][j]);
    return 0;
}