It's not very difficult, but the basic grammar can solve it:
#include<iostream>
using namespace std;
int main(){
int n,l[11000][3],x[11000],y[11000],a,b;
bool find=false;
cin>>n;
for(int i=0;i<n;i++){
cin>>l[i][0]>>l[i][1]>>x[i]>>y[i];}
cin>>a>>b;
for(int i=n-1;i>=0;i--){
if(l[i][0]<=a && l[i][0]+x[i]>=a && l[i][1]<=b && l[i][1]+y[i]>=b){
cout<<i+1<<endl;find=true;break;}
}
if(!find) cout<<-1<<endl;
return 0;
}