#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int main()
{
    int i,k,layer;
    char ch[82]={'\0'},type='\0',ch2[82]={'\0'};
    char way[87385][30]={'\0'},copyway[30]={'\0'};/*way=city*/
    /*copyway=ch[2]~ch[16]*/
    double jws[87385][3]={'\0'},copy[3]={'\0'};/*0=經度 1=緯度 2=面積*/
    int human[87385]={'\0'},copy2=0,treelayer[87385]={'\0'};/*human=人口*/
    /*TREELAYER存每個城市的層數*/
    while(gets(ch)!=NULL)
    {
        for(i=0;i<82;i++)               /*清array*/
            ch2[i]='\0';
        for(i=0;i<30;i++)
            copyway[i]='\0';
        for(i=0;i<3;i++)
        copy[i]='\0';
        copy2=0;

        type=ch[0];

        if(type=='I')
        {
            for(i=18;i<82;i++)    /*CH2=CH的後面那些數字*/
            {
                ch2[i-18]=ch[i];
            }
            for(i=2;i<17;i++) /*讓COPYWAY=城市名稱 */
            {
                copyway[i-2]=ch[i];
            }
            copy[0]=atof(strtok(ch2," \n\r\t"));/*經度*/
            copy[1]=atof(strtok(NULL," \n\r\t"));/*緯度*/
            copy2 = atoi(strtok(NULL," \n\r\t"));/*人口*/
            copy[2]=atof(strtok(NULL," \n\r\t"));/*面積*/
            k=1;
            layer=1;/*初始化K 和 LAYER*/
            while(treelayer[k]!='\0')
            {
                if(copy[0]<=jws[k][0] && copy[1]<=jws[k][1])
                {
                    k=4*k-2;
                    layer++;
                }
                else if(copy[0]<=jws[k][0] && copy[1]>jws[k][1])
                {
                    k=4*k-1;
                    layer++;
                }
                else if(copy[0]>jws[k][0] && copy[1]<=jws[k][1])
                {
                    k=4*k;
                    layer++;
                }
                else if(copy[0]>jws[k][0] && copy[1]>jws[k][1])
                {
                    k=4*k+1;
                    layer++;
                }

            }
             /* for(i=0;i<15;i++)
                  way[k][i]=copyway[i];*/


            strcpy(way[k],copyway);      /*把資訊存進ARRAY*/
            jws[k][0]=copy[0];
            jws[k][1]=copy[1];
            human[k]=copy2;
            jws[k][2]=copy[2];
            treelayer[k]=layer;
            printf("OK %s %d\n",way[k],treelayer[k]);
        }
        else if(type=='Q')
        {
            for(i=2;i<82;i++)
                ch2[i-2]=ch[i];

            copy[0]=atof(strtok(ch2," \n\r\t"));
            copy[1]=atof(strtok(NULL," \n\r\t"));
            k=1;
            while(!(copy[0]==jws[k][0] && copy[1]==jws[k][1]))
            {
                if((jws[k][0]=='\0' && jws[k][1]=='\0')||(copy[0]=='\0' && copy[1]=='\0')){
                    printf("NO\n");
                    break;
                }
                if(copy[0]<=jws[k][0] && copy[1]<=jws[k][1])
                {
                    k=4*k-2;
                }
                else if(copy[0]<=jws[k][0] && copy[1]>jws[k][1])
                {
                    k=4*k-1;
                }
                else if(copy[0]>jws[k][0] && copy[1]<=jws[k][1])
                {
                    k=4*k;
                }
                else if(copy[0]>jws[k][0] && copy[1]>jws[k][1])
                {
                    k=4*k+1;
                }
            }
            if(copy[0]==jws[k][0] && copy[1]==jws[k][1])
         printf("%s %d %.1f %d\n",way[k],human[k],jws[k][2],treelayer[k]);
        }
        else if(type=='E')
        {
            printf("BYE\n");
        }
    }
    return 0;
}