#include <iostream>
using namespace std;
struct Point{
int x1,y1;
int x2,y2;
int ceil;//窗口编号
};
const int n=15;
Point a[n];
int main(){
int N,M,j;
cin>>N>>M;
for(int i=0;i<N;++i){
cin>>a[i].x1>>a[i].y1>>a[i].x2>>a[i].y2;
a[i].ceil=(i+1);
}//初始化
for(int i=0;i<M;++i){
bool flag=false;
int x,y;
cin>>x>>y;
for(j=0;j<N;++j){
if(x<=a[j].x2&&x>=a[j].x1&&y<=a[j].y2&&y>=a[j].y1)
flag=true;
else
break;
}
if(flag)
cout<<a[j-1].ceil<<endl;
else
cout<<"IGNORED"<<endl;
if(j-1==N-1);//本身在顶层
else{
Point temp=a[j-1];
for(int k=j-1;k<N-1;++k)
a[k]=a[k+1];
a[N-1]=temp;
}
}
return 0;
}