import Control.Applicative
import Control.Monad
import Control.Monad.ST
-- import qualified Data.ByteString as BS
import Data.Functor
import Data.Function
import Data.Monoid
import Data.Maybe
import Data.List
import qualified Data.Foldable as Foldable
--import qualified Data.Set as Set
--import qualified Data.Sequence as Sequence
import Data.List.Split
import Data.Bits
import Data.Char
import Data.Ix
import Data.Ratio
import Data.Ord
import Data.Fixed
import Data.Tuple
import Data.Array
--import Data.Array.Unboxed
--import Data.Array.IArray
import Data.Array.MArray
import Data.Array.IO
import Data.Array.ST
import Data.IORef
import Data.STRef
import Text.Printf
import System.IO
-- import System.IO.Unsafe
 
-- templete
readInt = read :: String -> Int
readInteger = read :: String -> Integer
readDouble = read :: String -> Double
getInt = readLn :: IO Int
getInts = map readInt . words <$> getLine
getInteger = readLn :: IO Integer
getIntegers = map readInteger . words <$> getLine
getDouble = readLn :: IO Double
getDoubles = map readDouble . words <$> getLine
sjoin :: (Show a) => [a] -> String
sjoin = unwords . map show
tjoin :: (Show a, Show b) => (a, b) -> String
tjoin (x, y) = show x ++ (' ' : show y)
cond :: a -> a -> Bool -> a
cond t f c = if c then t else f
apply2 :: (a -> a -> b) -> [a] -> b
apply2 f [x,y] = f x y
apply3 :: (a -> a -> a -> b) -> [a] -> b
apply3 f [x,y,z] = f x y z
apply4 :: (a -> a -> a -> a -> b) -> [a] -> b
apply4 f [x,y,z,w] = f x y z w
fnTuple :: (a -> b, a -> c) -> a -> (b, c)
fnTuple (f,g) a = (f a, g a)
replace :: (Eq a) => a -> a -> [a] -> [a]
replace x y = map (\z -> if z==x then y else z)
binMap :: (a -> a -> b) -> [a] -> [b]
binMap f (x:xs@(y:_)) = f x y : binMap f xs
binMap _ _ = []
splitRec :: Int -> [a] -> [[a]]
splitRec _ [] = []
splitRec n xs = let (y,ys) = splitAt n xs in y : splitRec n ys
infixl 7 `divCeil`
divCeil :: Integral a => a -> a -> a
x `divCeil` y = (x+y-1) `div` y
coverC :: Ord a => (a, a) -> a -> Bool
coverC (l,r) x = l<=x && x<=r
coverH :: Ord a => (a, a) -> a -> Bool
coverH (l,r) x = l<=x && x<r
ibsearch :: (Int -> Bool) -> (Int,Int) -> Int
ibsearch f (ok,ng) = if abs (ok-ng) <= 1 then ok else let mid = (ok + ng) `div` 2 in ibsearch f (if f mid then (mid,ng) else (ok,mid))
whenM :: Monad m => m Bool -> m () -> m ()
whenM c a = c >>= flip when a
unconsU :: [a] -> (a, [a])
unconsU (x:xs) = (x, xs)
-- templete

type Point = (Int, Int)
type Rect = (Point, Point)

data Tag = Tag String Rect [Tag] deriving (Show)

parseTag :: String -> Tag
parseTag s = case parseTag' s of (Just t, _) -> t

parseTag' :: String -> (Maybe Tag, String)
parseTag' ('<':'/':s) = (Nothing, tail (dropWhile (/='>') s))
parseTag' ('<':s) = (Just (Tag name ((x1,y1),(x2,y2)) children), s6)
  where
    (name, s1) = fmap tail $ span (/='>') s
    (s2, x1) = fmap readInt $ swap $ fmap tail $ span isNumber s1
    (s3, y1) = fmap readInt $ swap $ fmap tail $ span isNumber s2
    (s4, x2) = fmap readInt $ swap $ fmap tail $ span isNumber s3
    (s5, y2) = fmap readInt $ swap $ span isNumber s4
    (children, s6) = sub s5
    sub ss = let (tag, s7) = parseTag' ss in case tag of
        Nothing -> ([], s7)
        Just t -> let (tags, s8) = sub s7 in (t:tags, s8)

wrap :: Tag -> Tag
wrap t = Tag "OUT OF MAIN PANEL" ((0,0),(10000,100000)) [t]

contains :: Point -> Tag -> Bool
contains (x,y) (Tag _ ((x1,y1),(x2,y2)) _) = x1<=x && x<=x2 && y1<=y && y<=y2

point :: Tag -> Point -> Tag
point tag@(Tag _ _ children) p = case find (contains p) children of
    Just subt -> point subt p
    Nothing -> tag

tagName :: Tag -> String
tagName (Tag name _  _) = name

childrenCount :: Tag -> Int
childrenCount (Tag _ _ cs) = length cs

main = do
    n <- getInt
    when (n/=0) $ do
        tag <- getLine
        ds <- map (apply2 (,)) <$> replicateM n getInts
        let panels = wrap $ parseTag tag
        forM ds $ \p -> do
            let panel = point panels p
            putStrLn $ unwords [tagName panel, (show . childrenCount) panel]
        main


Measured memory_bytes: 4004