#include<cstdio>
#include<algorithm>
#include<vector>
#define S 500007
#define M 2097152
using namespace std;

typedef long long ll;

int tree[2*M+7];
int tree2[2*M+7];
int lazy[2*M+7];

vector < pair < int ,int > > poczX;

vector < int > justX;
vector < pair < int, int > > poczY;


vector < pair < pair < int , int > , int > > oper;

pair < int , int > Prz[2*M+7];

void Add(int l, int r, int w, int c){
    if(l > Prz[w].second || r < Prz[w].first)
        return;
    if(l <= Prz[w].first && r >= Prz[w].second){
        //printf("%d %d %d %d %d %d*\n",w,c,l,r,Prz[w].first,Prz[w].second);
        tree[w]+=c;
        lazy[w]+=c;
        return;
    }
    lazy[w*2] += lazy[w];
    lazy[w*2+1] += lazy[w];
    tree[w*2] += lazy[w];
    tree[w*2+1] += lazy[w];
    lazy[w] = 0;
    Add(l,r,w*2,c);
    Add(l,r,w*2+1,c);
    if(tree[w*2] == tree[w*2+1]){
        tree[w] = tree[w*2];
        tree2[w] = tree2[w*2] + tree2[w*2+1];
    }else{
        tree[w] = max(tree[w*2],tree[w*2+1]);
        if(tree[w*2] > tree[w*2+1]){
            tree2[w] = tree2[w*2];
        }else{
            tree2[w] = tree2[w*2+1];
        }
    }
}

int x,y;

void dodaj(int l, int r, int c){
    //printf("%d %d %d##\n",l,r,c);
    if(r >= l){
        Add(l,r,1,c);
    }else{

    }

}


int main(void){
int n;
int a,b,c,d;
scanf("%d %d %d",&n,&x,&y);

for(int i = 1; i <= n;i++){
    scanf("%d %d %d %d",&a,&b,&c,&d);
    if(a > c)
        swap(a,c);
    if(b > d)
        swap(b,d);
    a++;
    b++;
    poczX.push_back({a,c});
    poczY.push_back({b,d});
    oper.push_back({{a,c},1});
    oper.push_back({{c,a},0});
    justX.push_back(a);
    justX.push_back(c);
}
sort(poczX.begin(),poczX.end());
sort(justX.begin(),justX.end());
sort(oper.begin(),oper.end());
int p = M;
Prz[p].first = 1;
Prz[p].second = justX[0]-1;
if(Prz[p].second == 0)
    Prz[p].second++;
else{
    p++;
    Prz[p] = {justX[0],justX[0]};
}

for(int i = 1; i < justX.size();i++){
    if(justX[i] == 1)
        continue;
    if(justX[i] == justX[i-1]){
        continue;
    }else if(justX[i] == justX[i-1] + 1){
        p++;
        Prz[p] = {justX[i],justX[i]};
    }else{
        p++;
        Prz[p] = {justX[i-1]+1,justX[i]-1};
        p++;
        Prz[p] = {justX[i],justX[i]};
    }
}
if(Prz[p].second != x){
    p++;
    Prz[p] = {Prz[p-1].second+1,x};
}
for(int i = M; i <= p;i++){
    tree2[i] = Prz[i].second - Prz[i].first+1;
}

for(int i = M-1; i>= 1;i--){
    if(Prz[i*2+1].second){
        Prz[i].second = Prz[i*2+1].second;
    }else{
        Prz[i].second = Prz[i*2].second;
    }
    Prz[i].first = Prz[i*2].first;
    tree2[i] = Prz[i].second - Prz[i].first+1;
}

for(int i = 0 ; i < poczX.size();i++){
    dodaj(1,poczX[i].first-1,1);
    dodaj(poczX[i].second+1,x,1);
}
int odp = 0;
if(tree[1] == n){
    odp = tree2[1];
}
//printf("%d %d*\n",tree[1],tree2[1]);
for(int i = 0; i < oper.size();i++){
    a = oper[i].first.first;
    b = oper[i].first.second;
    if(a < b){
        dodaj(a,b,1);
        dodaj(1,a-1,-1);
        dodaj(b+1,x,-1);
    }else if (a > b){
        dodaj(b,a,-1);
        dodaj(a+1,x,1);
        dodaj(1,b-1,1);
    }else{
        if(oper[i].second == 0){
            dodaj(a,b,1);
            dodaj(1,a-1,-1);
            dodaj(b+1,x,-1);
        }else{
            dodaj(a,b,-1);
            dodaj(1,a-1,1);
            dodaj(b+1,x,1);
        }
    }
    //printf("%d %d*\n",tree[1],tree2[1]);
    if(tree[1] == n){
        //printf("AASD");
        odp = max(odp,tree2[1]);
    }
}

for(int i = 1; i < 2*M;i++){
    tree[i] = tree2[i] = lazy[i] = 0;
    Prz[i] = {0,0};
}
justX.clear();
oper.clear();
poczX.clear();
x = y;
for(int i = 0; i < n;i++){
    a = poczY[i].first;
    c = poczY[i].second;
    poczX.push_back({a,c});
    oper.push_back({{a,c},1});
    oper.push_back({{c,a},0});
    justX.push_back(a);
    justX.push_back(c);
}

sort(poczX.begin(),poczX.end());
sort(justX.begin(),justX.end());
sort(oper.begin(),oper.end());
p = M;
Prz[p].first = 1;
Prz[p].second = justX[0]-1;
if(Prz[p].second == 0)
    Prz[p].second++;
else{
    p++;
    Prz[p] = {justX[0],justX[0]};
}

for(int i = 1; i < justX.size();i++){
    if(justX[i] == 1)
        continue;
    if(justX[i] == justX[i-1]){
        continue;
    }else if(justX[i] == justX[i-1] + 1){
        p++;
        Prz[p] = {justX[i],justX[i]};
    }else{
        p++;
        Prz[p] = {justX[i-1]+1,justX[i]-1};
        p++;
        Prz[p] = {justX[i],justX[i]};
    }
}
if(Prz[p].second != x){
    p++;
    Prz[p] = {Prz[p-1].second+1,x};
}
for(int i = M; i <= p;i++){
    tree2[i] = Prz[i].second - Prz[i].first+1;
}

for(int i = M-1; i>= 1;i--){
    if(Prz[i*2+1].second){
        Prz[i].second = Prz[i*2+1].second;
    }else{
        Prz[i].second = Prz[i*2].second;
    }
    Prz[i].first = Prz[i*2].first;
    tree2[i] = Prz[i].second - Prz[i].first+1;
}

for(int i = 0 ; i < poczX.size();i++){
    dodaj(1,poczX[i].first-1,1);
    dodaj(poczX[i].second+1,x,1);
}
int odp2 = 0;
if(tree[1] == n){
    odp2 = tree2[1];
}
//printf("%d %d*\n",tree[1],tree2[1]);
for(int i = 0; i < oper.size();i++){
    a = oper[i].first.first;
    b = oper[i].first.second;
    if(a < b){
        dodaj(a,b,1);
        dodaj(1,a-1,-1);
        dodaj(b+1,x,-1);
    }else if (a > b){
        dodaj(b,a,-1);
        dodaj(a+1,x,1);
        dodaj(1,b-1,1);
    }else{
        if(oper[i].second == 0){
            dodaj(a,b,1);
            dodaj(1,a-1,-1);
            dodaj(b+1,x,-1);
        }else{
            dodaj(a,b,-1);
            dodaj(1,a-1,1);
            dodaj(b+1,x,1);
        }
    }
    //printf("%d %d*\n",tree[1],tree2[1]);
    if(tree[1] == n){
        //printf("AASD");
        odp2 = max(odp2,tree2[1]);
    }
}
ll odp3 = (ll)odp;
odp3 *= (ll)odp2;

printf("%lld",odp3);
return 0;
}