TOYS

Count how many toys land in each bin of a partitioned toy box.

A child named John never puts his toys away after playing. His parents gave him a rectangular box to hold the toys, but John simply throws each toy into the box, so all the toys get mixed together and he can never find his favorites.

To keep things organized, John's parents insert cardboard partitions into the box. Even when John keeps tossing toys in, toys that land in different bins stay separated. The diagram below shows a top view of an example toy box.

For this problem, determine how many toys fall into each bin as John throws them into the box.

The input contains one or more test cases. The first line of each test case has six integers $n$, $m$, $x_1$, $y_1$, $x_2$, $y_2$. Here $n$ is the number of cardboard partitions ($0 < n \le 5000$) and $m$ is the number of toys ($0 < m \le 5000$). The point $(x_1, y_1)$ is the upper-left corner of the box and $(x_2, y_2)$ is its lower-right corner.

The next $n$ lines each contain two integers $U_i$ and $L_i$: the $i$-th partition runs from $(U_i, y_1)$ at the top to $(L_i, y_2)$ at the bottom. The partitions do not intersect and are given in order from left to right.

The following $m$ lines each contain two integers $X_j$ and $Y_j$, the landing position of the $j$-th toy. The toys are listed in arbitrary order. No toy lands exactly on a partition or outside the box.

The input ends with a line containing a single $0$.

For each test case, print one line per bin. For each bin, print the bin number, then a colon and a single space, then the number of toys that landed in that bin. Bins are numbered from $0$ (leftmost) to $n$ (rightmost). Separate the output of consecutive test cases with a single blank line.