20昏，本蒟蒻求调

#include <bits/stdc++.h>
using namespace std;
int n;
struct node{
	int a,b,g,k,size,num;
}s[1005];
int x,y;
bool cmp(node x,node y){
	return x.size<y.size;
}
int main(){
	cin >> n;
	for(int i=1;i<=n;i++){
		cin >> s[i].a >> s[i].b >> s[i].g >> s[i].k;
		s[i].size=s[i].g*s[i].k;
		s[i].num=i;
	}
	cin >> x >> y;
	sort(s+1,s+n+1,cmp);
	int k=-1;
	for(int i=1;i<=n;i++){
		if(s[i].a+s[i].g>=x && s[i].a<=x &&s[i].b+s[i].k>=y && s[i].b<=y){
			k=s[i].num;
		}
	}
	cout << k;
	return 0;
}