Hungry Cow

문제

Bessie is a hungry cow. Each day, for dinner, if there is a haybale in the barn, she will eat one haybale. Farmer John does not want Bessie to starve, so some days he sends a delivery of haybales, which arrive in the morning (before dinner). In particular, on day $d_{i}d\_i$, Farmer John sends a delivery of $b_{i}b\_i$ haybales ($1\le d_i\le {10}^{14}1\backslash leq\; d\_i\; \backslash leq\; 10^\{14\}$, $0\le b_i\le {10}^{9}0\backslash leq\; b\_i\; \backslash leq\; 10^9$).

Process $UU$ ($1\le U\le {10}^{5}1\backslash le\; U\backslash le\; 10^5$) updates as follows: Given a pair $(d,b)(d,\; b)$, update the number of haybales arriving on day $dd$ to $bb$. After each update, output the sum of all days on which Bessie eats haybales modulo ${10}^9+710^9+7$.

입력

$UU$, followed by $UU$ lines containing the updates.

출력

The sum after each update modulo ${10}^9+710^9+7$.