Score : $200$ points

Problem Statement

Joisino is about to compete in the final round of a certain programming competition. In this contest, there are $N$ problems, numbered $1$ through $N$. Joisino knows that it takes her $T_i$ seconds to solve problem $i(1 \leq i \leq N)$.

Also, there are $M$ kinds of drinks offered to the contestants, numbered $1$ through $M$. If Joisino takes drink $i(1 \leq i \leq M)$, her brain will be stimulated and the time it takes for her to solve problem $P_i$ will become $X_i$ seconds. It does not affect the time to solve the other problems.

A contestant is allowed to take exactly one of the drinks before the start of the contest. For each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink. Here, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems. Your task is to write a program to calculate it instead of her.

Constraints

• All input values are integers.
• $1 \leq N \leq 100$
• $1 \leq T_i \leq 10^5$
• $1 \leq M \leq 100$
• $1 \leq P_i \leq N$
• $1 \leq X_i \leq 10^5$

Input

The input is given from Standard Input in the following format:

$N$

$T_1$ $T_2$ $...$ $T_N$

$M$

$P_1$ $X_1$

$P_2$ $X_2$

$:$

$P_M$ $X_M$

Output

For each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.

3
2 1 4
2
1 1
2 3

6
9

If Joisino takes drink $1$, the time it takes her to solve each problem will be $1$, $1$ and $4$ seconds, respectively, totaling $6$ seconds.

If Joisino takes drink $2$, the time it takes her to solve each problem will be $2$, $3$ and $4$ seconds, respectively, totaling $9$ seconds.

5
7 2 3 8 5
3
4 2
1 7
4 13

19
25
30