1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
#include <bits/stdc++.h>
using namespace std;
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define VI vector<int>
#define VPII vector<PII>
#define LL long long
#define LD long double
#define f first
#define s second
#define MP make_pair
#define PB push_back
#define endl '\n'
#define ALL(c) (c).begin(), (c).end()
#define SIZ(c) (int)(c).size()
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, b, e) for(int i = (b); i <= (int)(e); ++i)
#define FORD(i, b, e) for(int i = (b); i >= (int)(e); --i)
#define sim template<class n
sim, class s> ostream & operator << (ostream &p, pair<n, s> x)
{return p << "<" << x.f << ", " << x.s << ">";}
sim> auto operator << (ostream &p, n y) ->
typename enable_if<!is_same<n, string>::value, decltype(y.begin(), p)>::type 
{int o = 0; p << "{"; for(auto c: y) {if(o++) p << ", "; p << c;} return p << "}";}
void dor() {cerr << endl;}
sim, class...s> void dor(n p, s...y) {cerr << p << " "; dor(y...);}
sim, class s> void mini(n &p, s y) {if(p>y) p = y;}
sim, class s> void maxi(n &p, s y) {if(p<y) p = y;}
#ifdef DEB
#define debug(...) dor(__FUNCTION__, ":", __LINE__, ": ", __VA_ARGS__)
#else
#define debug(...)
#endif 

#define I(x) #x " =", (x), " "
#define A(a, i) #a "[" #i " =", i, "] =", a[i], " "
#define ULL unsigned LL

// ******************************************************************************

mt19937_64 gen(1602650175);
uniform_int_distribution<unsigned long long> distr;
ULL get_random()
  {
  return distr(gen);
  }

int solve(VPII x, int X)
  {
  vector<pair<int, ULL>> events = {{0, 0ULL}, {X, 0ULL}};
  for(auto i : x)
    {
    ULL val = get_random();
    events.PB(MP(i.f, val));
    events.PB(MP(i.s+1, val));
    }

  unordered_map<ULL, int> cnt;
  int pop = 0;
  ULL hash = 0;
  sort(ALL(events));
  for(auto i: events)
    {
    if(pop != i.f)
      {
      cnt[hash] += i.f - pop;
      pop = i.f;
      }
    hash ^= i.s;
    }
  
  int res = 0;
  for(auto i: cnt) maxi(res, i.s);
  return res;
  }

int main()
  {
  int n, X, Y;
  scanf("%d%d%d", &n, &X, &Y);

  VPII x, y;
  REP(u, n)
    {
    int x1, y1, x2, y2;
    scanf("%d%d%d%d", &x1, &y1, &x2, &y2);

    if(x1 > x2)swap(x1, x2);
    if(y1 > y2)swap(y1, y2);
    x.PB(MP(x1, x2-1));
    y.PB(MP(y1, y2-1));
    }
  LL res_x = solve(x, X);
  LL res_y = solve(y, Y);

  printf("%lld\n", res_x * res_y);
  }