CF609F.Frogs and mosquitoes

There are n frogs sitting on the coordinate axis Ox. For each frog two values x__i, t__i are known — the position and the initial length of the tongue of the i-th frog (it is guaranteed that all positions x__i are different). m mosquitoes one by one are landing to the coordinate axis. For each mosquito two values are known p__j — the coordinate of the position where the j-th mosquito lands and b__j — the size of the j-th mosquito. Frogs and mosquitoes are represented as points on the coordinate axis.

The frog can eat mosquito if mosquito is in the same position with the frog or to the right, and the distance between them is not greater than the length of the tongue of the frog.

If at some moment several frogs can eat a mosquito the leftmost frog will eat it (with minimal x__i). After eating a mosquito the length of the tongue of a frog increases with the value of the size of eaten mosquito. It's possible that after it the frog will be able to eat some other mosquitoes (the frog should eat them in this case).

For each frog print two values — the number of eaten mosquitoes and the length of the tongue after landing all mosquitoes and after eating all possible mosquitoes by frogs.

Each mosquito is landing to the coordinate axis only after frogs eat all possible mosquitoes landed before. Mosquitoes are given in order of their landing to the coordinate axis.

有 $n$ 只青蛙坐在坐标轴 $Ox$ 上。对第 $i$ 只青蛙，已知两个值 $x_i$ 和 $t_i$ —— 分别表示该青蛙的位置及其舌头的初始长度（保证所有位置 $x_i$ 互不相同）。依次有 $m$ 只蚊子降落在坐标轴上。对第 $j$ 只蚊子，已知两个值：$p_j$ —— 该蚊子降落的位置坐标，以及 $b_j$ —— 该蚊子的尺寸。青蛙和蚊子均被表示为坐标轴上的点。

一只青蛙可以吃掉一只蚊子，当且仅当该蚊子位于该青蛙所在位置或其右侧，且两者之间的距离不超过该青蛙舌头的长度。

在某一时刻，若有多只青蛙都能吃掉同一只蚊子，则最左侧的青蛙（即 $x_i$ 最小者）将吃掉它。青蛙吃掉蚊子后，其舌头长度增加量等于所吃蚊子的尺寸 $b_j$。有可能在舌头变长之后，该青蛙又能吃掉其他尚未被吃掉的蚊子（此时该青蛙必须立即吃掉所有它能吃掉的新蚊子）。

对每只青蛙，请输出两个值：它总共吃掉的蚊子数量，以及在所有蚊子全部降落完毕、且所有青蛙吃完所有可能的蚊子之后，它的舌头长度。

每只蚊子仅在之前所有已降落的蚊子均已被青蛙尽可能吃掉之后，才降落到坐标轴上。输入中蚊子按其降落顺序给出。

First line contains two integers n, m (1 ≤ n, m ≤ 2·105) — the number of frogs and mosquitoes.

Each of the next n lines contains two integers x__i, t__i (0 ≤ x__i, t__i ≤ 109) — the position and the initial length of the tongue of the i-th frog. It is guaranteed that all x__i are different.

Next m lines contain two integers each p__j, b__j (0 ≤ p__j, b__j ≤ 109) — the position and the size of the j-th mosquito.

第一行包含两个整数 $n$ 和 $m$（$1 \leq n, m \leq 2 \cdot 10^5$）—— 分别表示青蛙的数量和蚊子的数量。

接下来的 $n$ 行，每行包含两个整数 $x_i$、$t_i$（$0 \leq x_i, t_i \leq 10^9$）—— 表示第 $i$ 只青蛙的位置及其舌头的初始长度。保证所有 $x_i$ 互不相同。

接下来的 $m$ 行，每行包含两个整数 $p_j$、$b_j$（$0 \leq p_j, b_j \leq 10^9$）—— 表示第 $j$ 只蚊子的位置及其大小。

Print n lines. The i-th line should contain two integer values c__i, l__i — the number of mosquitoes eaten by the i-th frog and the length of the tongue of the i-th frog.

输出 n 行。第 i 行应包含两个整数值 c__i 和 l__i —— 分别表示第 i 只青蛙吃掉的蚊子数量以及第 i 只青蛙的舌头长度。