救民于水火

#include <bits/stdc++.h>
using namespace std;
const int maxn = 10000 + 10;
int x[maxn], y[maxn], g[maxn], k[maxn];
int a, b, p, n;
int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> x[i] >> y[i] >> g[i] >> k[i];
    cin >> a >> b;
    p = -1;
    for (int i = n; i >= 1; i--) {
        if (a >= x[i] && a <= x[i] + g[i] && b >= y[i] && b <= y[i] + k[i]) {
            p = i;
            break;
        }
    }
    cout << p;
    return 0;
}