#include <bits/stdc++.h>
using namespace std;
string DBG_DLM(int& i) { return (i++ == 0 ? "" : ", "); }
template <class T>
ostream& operator<<(ostream& os, vector<T> v);
template <class T>
ostream& operator<<(ostream& os, set<T> v);
template <class T>
ostream& operator<<(ostream& os, queue<T> q);
template <class T>
ostream& operator<<(ostream& os, priority_queue<T> q);
template <class T, class K>
ostream& operator<<(ostream& os, pair<T, K> p);
template <class T, class K>
ostream& operator<<(ostream& os, map<T, K> mp);
template <class T, class K>
ostream& operator<<(ostream& os, unordered_map<T, K> mp);
template <int I, class TPL>
void DBG(ostream& os, TPL t) {}
template <int I, class TPL, class H, class... Ts>
void DBG(ostream& os, TPL t) {
  os << (I == 0 ? "" : ", ") << get<I>(t);
  DBG<I + 1, TPL, Ts...>(os, t);
}
template <class T, class K>
void DBG(ostream& os, pair<T, K> p, string delim) {
  os << "(" << p.first << delim << p.second << ")";
}
template <class... Ts>
ostream& operator<<(ostream& os, tuple<Ts...> t) {
  os << "(";
  DBG<0, tuple<Ts...>, Ts...>(os, t);
  os << ")";
  return os;
}
template <class T, class K>
ostream& operator<<(ostream& os, pair<T, K> p) {
  DBG(os, p, ", ");
  return os;
}
template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
  {
    int i = 0;
    os << "{";
    {
      for (auto&& t : v) {
        os << DBG_DLM(i) << t;
      };
    }
    os << "}";
    return os;
  };
}
template <class T>
ostream& operator<<(ostream& os, set<T> s) {
  {
    int i = 0;
    os << "{";
    {
      for (auto&& t : s) {
        os << DBG_DLM(i) << t;
      };
    }
    os << "}";
    return os;
  };
}
template <class T>
ostream& operator<<(ostream& os, queue<T> q) {
  {
    int i = 0;
    os << "{";
    {
      for (; q.size(); q.pop()) {
        os << DBG_DLM(i) << q.front();
      };
    }
    os << "}";
    return os;
  };
}
template <class T>
ostream& operator<<(ostream& os, priority_queue<T> q) {
  {
    int i = 0;
    os << "{";
    {
      for (; q.size(); q.pop()) {
        os << DBG_DLM(i) << q.top();
      };
    }
    os << "}";
    return os;
  };
}
template <class T, class K>
ostream& operator<<(ostream& os, map<T, K> m) {
  {
    int i = 0;
    os << "{";
    {
      for (auto&& p : m) {
        os << DBG_DLM(i);
        DBG(os, p, "->");
      };
    }
    os << "}";
    return os;
  };
}
template <class T, class K>
ostream& operator<<(ostream& os, unordered_map<T, K> m) {
  {
    int i = 0;
    os << "{";
    {
      for (auto&& p : m) {
        os << DBG_DLM(i);
        DBG(os, p, "->");
      };
    }
    os << "}";
    return os;
  };
}
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using vs = vector<string>;
using vvs = vector<vs>;
using vvvs = vector<vvs>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
using vvvpii = vector<vvpii>;
template <class T>
bool amax(T& a, const T& b) {
  return a < b ? a = b, 1 : 0;
}
template <class T>
bool amin(T& a, const T& b) {
  return a > b ? a = b, 1 : 0;
}
ll ri() {
  ll l;
  cin >> l;
  return l;
}
string rs() {
  string s;
  cin >> s;
  return s;
}
template <typename T>
struct BinaryIndexedTree0 {
  const int N;
  vector<T> val;
  BinaryIndexedTree0(int N) : N(N), val(N) {}
  T sum(int i) const {
    T s = 0;
    --i;
    if (i >= N) i = N - 1;
    for (; i >= 0; i = (i & (i + 1)) - 1) s += val[i];
    return s;
  }
  T sum(int l, int r) const { return sum(r) - sum(l); }
  void add(int i, T x) {
    for (; i < N; i |= i + 1) val[i] += x;
  }
  void set(int i, T x) {
    T c = sum(i, i + 1);
    add(i, x - c);
  }
  int lower_bound(T w) const {
    int x = 0;
    for (int k = (1 << (31 - __builtin_clz(N))) - 1;; k >>= 1) {
      if (x + k < N && val[x + k] < w) {
        w -= val[x + k];
        x += k + 1;
      }
      if (k == 0) break;
    }
    return x;
  }
};
void Main() {
  int d = ri();
  int w = ri();
  int h = ri();
  BinaryIndexedTree0<int> lef(w + 1);
  BinaryIndexedTree0<int> rig(w + 1);
  BinaryIndexedTree0<int> top(h + 1);
  BinaryIndexedTree0<int> bot(h + 1);
  vi X1(d), Y1(d), X2(d), Y2(d);
  for (int i = int(0); i < int(d); ++i) {
    int x1 = ri() - 1;
    int y1 = ri() - 1;
    int x2 = ri() - 1;
    int y2 = ri() - 1;
    int t = min(y1, y2);
    int b = max(y1, y2);
    int l = min(x1, x2);
    int r = max(x1, x2);
    ;
    lef.add(l, 1);
    rig.add(r, 1);
    top.add(t, 1);
    bot.add(b, 1);
    X1[i] = x1;
    Y1[i] = y1;
    X2[i] = x2;
    Y2[i] = y2;
  }
  int cl = ri();
  int cr = ri();
  int ct = ri();
  int cb = ri();
  for (int i = int(0); i < int(d); ++i) {
    int x1 = X1[i];
    int y1 = Y1[i];
    int x2 = X2[i];
    int y2 = Y2[i];
    int t = min(y1, y2);
    int b = max(y1, y2);
    int l = min(x1, x2);
    int r = max(x1, x2);
    int ll = lef.sum(0, r);
    int rr = rig.sum(l + 1, w + 1);
    int tt = top.sum(0, b);
    int bb = bot.sum(t + 1, h + 1);
    if (l == r) {
      tt--;
      bb--;
    } else {
      ll--;
      rr--;
    };
    if (ll == cl && rr == cr && tt == ct && bb == cb) {
      cout << (i + 1) << endl;
      return;
    }
  }
  cout << -1 << endl;
}
signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  Main();
  return 0;
}
