시간 제한메모리 제한제출정답맞힌 사람정답 비율
6 초 1024 MB664100.000%

## 문제

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$, Farmer John sends a delivery of $b_i$ haybales ($1\leq d_i \leq 10^{14}$, $0\leq b_i \leq 10^9$).

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

## 입력

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

## 출력

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

## 예제 입력 1

3
4 3
1 5
1 2


## 예제 출력 1

15
36
18


Answers after each update:

4+5+6=15
1+2+3+4+5+6+7+8=36
1+2+4+5+6=18


## 예제 입력 2

9
1 89
30 7
101 26
1 24
5 1
60 4
5 10
101 0
1 200


## 예제 출력 2

4005
4656
7607
3482
3507
3753
4058
1107
24531