#include<iostream>

 using namespace std;

 int wind[];//记录的是当前窗口在哪个顺序

 int n,m,x,y;

 struct area{

     int x1;

     int y1;

     int x2;

     int y2;

 };

 area a[];

 bool inarea(int i,int x,int y)

 {

     return x>=a[i].x1&&x<=a[i].x2&&y>=a[i].y1&&y<=a[i].y2;

 }

 void totop(int c)

 {

     wind[]=wind[c];

     for(int i=c;i>=;i--)

         wind[i]=wind[i-];

 }

 int main()

 {

     cin>>n>>m;

     for(int i=;i<=n;i++)

     {

         wind[n-i+]=i;

         cin>>a[i].x1>>a[i].y1>>a[i].x2>>a[i].y2;

     }

     int j;

     while(m--)

     {

         cin>>x>>y;

         for(j=;j<=n;j++)

         {

             if(inarea(wind[j],x,y))

                 break;

         }

         //cout<<j<<"gg"<<endl;

         if(j==n+)

             cout<<"IGNORED"<<endl;

         else

         {

             cout<<wind[j]<<endl;

             totop(j);

         }

     }

     return ;

 }