2015-2

/*
2020/4/17
第二遍
*/
#include <iostream>
#include<stdio.h>
using namespace std;


int n,m;
struct Window
{
    int id;
    int lx,ly;
    int rx,ry;
}windows[20],temp;

int cmp(Window w,int x,int y)
{
    if(x>=w.lx && x<=w.rx && y>=w.ly && y<=w.ry)
        return 1;
    else
        return 0;
}

int main()
{
    scanf("%d",&n);
    for(int i = 0;i<n;i++)
    {
        scanf("%d%d%d%d%d",&windows[i].id,&windows[i].lx,&windows[i].ly,&windows[i].rx,&windows[i].ry);
    }

    scanf("%d",&m);
    int top = 0;
    for(int i = 0;i<m;i++)
    {
        top = 0;
        int x,y;
        scanf("%d%d",&x,&y);
        for(int j = 0;j<n;j++)
        {
            if(cmp(windows[j],x,y))
            {
                top = j;
                break;
            }
        }

        if(top!=0)
        {
            temp = windows[top];
            for(int k = top - 1;k>=0;k--)//**********自己非常容易写成k++
            {
                windows[k + 1] = windows[k];
            }
            windows[0] = temp;
        }
    }


    for(int i = 0;i<n;i++)
    {
        if(i==n-1)
        {
            printf("%d\n",windows[i].id);
        }
        else
        {
            printf("%d ",windows[i].id);
        }
    }
    return 0;
}
/*
IN:
4
1 43 31 70 56
2 50 24 80 50
3 23 13 63 42
4 57 36 90 52
5
47 28
73 40
68 32
82 43
82 43
OUT:
4 2 3 1
*/