全WA求助！！

#include <iostream>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <cstdlib>
#include <cctype>
#define ll long long
#define sll static long long
#define db double
#define sint static int
#define lint inline int
#define lb inline bool
#define lll inline long long
using namespace std;
struct node {
	int a, b, g, k;
} blanket[100010];
int n, sx, sy;
int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		int t, y, u, o;
		cin >> t >> y >> u >> o;
		blanket[i] = node{ t,y,u,o };
	}
	cin >> sx >> sy;
	int ans = -1;
	for (int i = 0; i < n; i++) {
		int a = blanket[i].a, b = blanket[i].b, g = blanket[i].g, k = blanket[i].k;
		if (sx >= a and sy >= b and sx <= a + g and sy <= b + k)
			ans = i + 1;
	}
	cout << ans;
	return 0;
}