Problem:
 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≦i≦N) .  Also, there are M kinds of drinks offered to the contestants, numbered 1 through M .
If Joisino takes drink i(1≦i≦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≦N≦100  1≦T_i≦10^5  1≦M≦100  1≦P_i≦N  1≦X_i≦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.        Sample Input 1 3
2 1 4
2
1 1
2 3      Sample Output 1 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.       Sample Input 2 5
7 2 3 8 5
3
4 2
1 7
4 13      Sample Output 2 19
25
30

Solution (Python):
n=int(input())
t=list(map(int,input().split()))
all=sum(t)
m=int(input())
for i in range(m):
    p,x=map(int,input().split())
    print(all-(t[p-1]-x))

Solution (Python):
problem_num = input()
time_usual = map(int, raw_input().split())
SUM = sum(time_usual)
m = input()
for i in xrange(m):
    p, time_drink = map(int, raw_input().split())
    p -= 1
    print SUM - time_usual[p] + time_drink

Solution (Python):
problem_num = int(input())
solve_time = []
sum_time = 0
for t in input().split():
    solve_time.append(int(t))
    sum_time += int(t)

drink_num = int(input())
pair = []
for i in range(drink_num):
    program_num, time = map(int, input().split())
    pair.append((program_num, time))

for i in range(drink_num):
    label = pair[i][0]
    time = pair[i][1]
    print(sum_time + time - solve_time[label - 1])

Solution (Python):

N = int(input())
T = list(map(int,input().split()))
M = int(input())
P = [ list(map(int,input().split())) for i in range (M) ]

for tmp in range (M):
    ans = P[tmp][1]
    for tmp2 in range (N):
        if tmp2 == P[tmp][0] - 1:
            continue
        else:
            ans += T[tmp2]
    print(ans)

Solution (Python):
N = int(input())
T = [int(n) for n in input().split()]
M = int(input())
P=[]
X=[]
for i in range(M):
    a,b=[int(n) for n in input().split()]
    P.append(a)
    X.append(b)

s=0
for i in range(N):
    s += T[i]

for i in range(M):
    print ( s - (T[P[i]-1] - X[i] ) )

Solution (Python):
N = int(input())
T = list(map(int,input().split()))
M = int(input())
P = []
X = []
for i in range(M):
    a, b =map(int,input().split())
    P.append(a)
    X.append(b)
for i in range(M):
    print(sum(T) - T[P[i]-1] + X[i])

Solution (Python):
N = int(input())
T = list(map(int, input().split()))
M = int(input())
PX = []
for i in range(M):
    PX.append(list(map(int, input().split())))

for i in PX:
    temp = T[:]
    temp[i[0]-1] = i[1]
    print(sum(temp))

Solution (Python):
input()
T = list(map(int, input().split(' ')))
S = sum(T)
for i in range(int(input())):
    P, X = map(int, input().split(' '))
    print(S - T[P - 1] + X)

Solution (Python):
n = input()
a = map(int, raw_input().split())
s = sum(a)
m = input()
for i in xrange(m):
	p, x = map(int, raw_input().split())
	p -= 1
	print s - a[p] + x

Solution (Python):
n = int(raw_input().strip())
t = map(int, raw_input().strip().split())

t_all = sum(t)

m = int(raw_input().strip())
for i in range(m):
	p, x = map(int, raw_input().strip().split())
	print t_all - t[p-1] + x

Solution (Python):
n = int(input())
t = list(map(int,input().split()))
m = int(input())

T = 0
for v in t:
    T += v

for i in range(m):
    p,x = map(int,input().split())
    p -= 1
    print(T-t[p]+x)

Solution (Python):


N = int(input())
data = list(map(int, input().split()))
M = int(input())
drink = [list(map(int, input().split())) for i in range(M)]
S = 0
for i in range(N):
    S += data[i]
for i in range(M):
    print(S - (data[drink[i][0] - 1] - drink[i][1]))

Solution (Python):

N = int(input())
T = [int(t) for t in input().split()]
M = int(input())

for i in range(M):
    p, x = map(int, input().split())

    Tp = T[:]
    Tp[p - 1] = x

    print(sum(Tp))

Solution (Python):
n = int(input())
d = list(map(int, input().split()))
s = sum(d)
m = int(input())
for i in range(m):
  k, v = map(int, input().split())
  print(s - d[k-1] + v)

Solution (Python):
N = int(raw_input())
T = [0] + map(int, raw_input().split())
M = int(raw_input())
P = [map(int, raw_input().split()) for _ in range(M)]

S = sum(T)
for p, x in P:
    print S - T[p] + x

Solution (Python):
N = int(input())
T = list(map(lambda x:int(x), input().split()))
M = int(input())
P = [0]*M
X = [0]*M
for i in range(M):
	p, x = map(lambda x:int(x), input().split())
	P[i] = p
	X[i] = x

sum_origin = sum(T)
for i in range(M):
	sum = sum_origin-T[P[i]-1]+X[i]
	print(sum)

Solution (Python):
_ = raw_input()
tests = [int(test) for test in raw_input().split(" ")]
total_time = sum(tests)
drinks = int(raw_input())
for _ in range(drinks):
    i = [int(x) for x in raw_input().split(" ")]
    no, time = i[0], i[1]
    print total_time - (tests[no - 1] - time)

Solution (Python):


import sys

def read_data():
    lines = [line.rstrip() for line in sys.stdin]
    ns = [int(n) for n in lines[1].split()]
    ms = [(int(line.split()[0]), int(line.split()[1])) for line in lines[3:]]
    return ns, ms

def main():
    ns, ms = read_data()
    for (drink_num, drink_sec) in ms:
        result = sum(ns) - ns[drink_num-1] + drink_sec
        print result


if __name__ == "__main__":
    main()

Solution (Python):

T = []
N = int(raw_input())
T = raw_input().split()
M = int(raw_input())
PX = []
X = 0
T1 = []


for i in range(M):
    PX.append(map(int,raw_input().split()))


for j in range(M):
    
    T1 = T[:]
    PJ = PX[j][0]
    XJ = PX[j][1]
    a = int(PJ)
    b = int(XJ)
    T1[a-1] = b
    
    
    X = 0
    for k in range(N):
            X += int(T1[k])
    print X

Solution (Python):
N = int(input())

Ts = list(map(int,input().split()))
M = int(input())
sumTime = sum(Ts)
for i in range(0,M):
    pi, xi = map(int,input().split())
    print(sumTime + xi - Ts[pi-1])

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

def LI(): return list(map(int, input().split()))
def II(): return int(input())
def LS(): return input().split()
def S(): return input()


def main():
    n = II()
    a = LI()
    s = sum(a)
    m = II()
    for _ in range(m):
        p,x = LI()
        print(s-a[p-1]+x)

main()

Solution (Python):
N = int(input())
T = [0] + list(map(int, input().split()))
M = int(input())

summ = sum(T)

for i in range(M):
	P, X = map(int, input().split())
	print(summ + X - T[P])

Solution (Python):
N = int(input())
T = list(map(int, input().split()))
M = int(input())
P, X = [], []
for _ in [0]*M:
    p, x = map(int, input().split())
    P.append(p)
    X.append(x)
total = sum(T)
for i in range(len(P)):
    print(total + X[i] - T[P[i]-1])

Solution (Python):
N = int(input())
T = [int(i) for i in input().split()]
M = int(input())
for i in range(M):
    P, X = map(int, input().split())
    result = 0
    for j in range(len(T)):
        if j == (P-1):
            result += X
        else:
            result += T[j]
    print(result)

Solution (Python):
N = input()
T = map(int, raw_input().split())
S = sum(T)
M = input()
for i in xrange(M):
    p, x = map(int, raw_input().split())
    print S + x - T[p-1]

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
time_sum=sum(a)

k=int(input())
d=[]

for i in range(k):
    p,x=map(int,input().split())
    d.append((p-1,x))

for j in range(k):
    print(time_sum-a[d[j][0]]+d[j][1])

Solution (Python):
N = int(input())
T = [int(i) for i in input().split()]
M = int(input())
ans = sum(T)
for i in range(M):
	P, X = map(int, input().split())
	print(ans-T[P-1]+X)

Solution (Python):


N = int(input())
T = list(map(int, input().split()))
M = int(input())

for i in range(M):
    p, x = map(int, input().split())
    count = 0
    for j in range(len(T)):
        if j+1 == p:
            count = count + x
        else:
            count = count + T[j]
    print(count)

Solution (Python):
input()
ts = list(map(int, input().split()))
t_sum = sum(ts)
m = int(input())
for _ in range(m):
    p, x = map(int, input().split())
    print(t_sum - ts[p - 1] + x)

Solution (Python):
input()
t = list(map(int, input().split()))
total = sum(t)

m = int(input());
for i in range(m):
    m, x = map(int, input().split())
    print (total + x - t[m - 1])

Solution (Python):
n = int(input())
ts = list(map(int, input().split()))
m = int(input())
s = sum(ts)
for i in range(m):
    n,m = map(int, input().split())
    print(s - ts[n-1] + m)

Solution (Python):
N = int(input())
T = list(map(int,input().split()))
M = int(input())
base = sum(T)
result = []
for i in range(M):
    P,X = map(int, input().split())
    result.append(base - T[P-1] + X)
print("\n".join([str(x) for x in result]))

Solution (Python):
N = int(input())
T = list(map(int, input().split()))
M = int(input())
tmp = sum(T)
for m in range(M):
    p, x = map(int, input().split())
    print(tmp - T[p-1] + x)

Solution (Python):
n = int(input())
t = list(map(int, input().split()))
mem = 0
m = int(input())
for i in range(m):
    p, x = map(int, input().split())
    mem = t[p-1]
    t[p-1] = x
    print(sum(t))
    t[p-1] = mem

Solution (Python):
def main():
    N = int(input())
    T = list(map(int, input().split()))
    M = int(input())
    P, X = [0] * M, [0] * M
    for i in range(M):
        P[i], X[i] = map(int, input().split())
    s = sum(T)
    for i in range(M):
        print(s - T[P[i]-1] + X[i])

if __name__ == '__main__':
    main()

Solution (Python):



N = int(input())
T = list(map(int, input().split()))
M = int(input())
for i in range(M):
    P, X = map(int, input().split())
    ans = sum(T) - T[P-1] + X
    print(ans)

Solution (Python):


n=int(raw_input())
t=map(int,raw_input().split())
m=int(raw_input())
v=[]
for i in xrange(m):
 u=t[:]
 p,x=map(int,raw_input().split())
 u[p-1]=x
 v.append(sum(u))
for i in xrange(m):
 print v[i]

Solution (Python):
n=int(raw_input())
t=map(int,raw_input().split())
total=sum(t)
m=int(raw_input())
for _ in xrange(m):
	p,x=map(int,raw_input().split())
	print total-t[p-1]+x

Solution (Python):

N = int(input())
T = [int(i) for i in input().split(" ")]
M = int(input())
P=[i for i in range(M)]
X=[i for i in range(M)]
for i in range(M):
    P[i],X[i]= [int(j) for j in input().split(" ")]
for i in range(M):
    temp = T[P[i]-1]
    T[P[i]-1]=X[i]
    print(sum(T))
    T[P[i]-1] = temp

Solution (Python):
n=int(raw_input())
t=map(int,raw_input().split())
m=int(raw_input())
pt=[map(int,raw_input().split()) for _ in xrange(m)]
ans=[0]*m
for i in xrange(m):
    tmp=list(t)
    tmp[pt[i][0]-1]=pt[i][1]
    for j in xrange(n):
        ans[i]+=tmp[j]
for i in xrange(m):
    print(ans[i])

Solution (Python):
import copy
n=int(raw_input())
t=map(int,raw_input().split())
m=int(raw_input())
pt=[map(int,raw_input().split()) for _ in xrange(m)]
ans=[0]*m
for i in xrange(m):
    tmp=copy.deepcopy(t)
    tmp[pt[i][0]-1]=pt[i][1]
    for j in xrange(n):
        ans[i]+=tmp[j]
for i in xrange(m):
    print(ans[i])

Solution (Python):
n=int(input())
t=list(map(int,input().split()))
total=sum(t)
m=int(input())
for _ in range(m):
    p,x=map(int,input().split())
    print(total-t[p-1]+x)

Solution (Python):
input()
ts = list(map(int, input().split()))
s = sum(ts)
m = int(input())
for _ in range(m):
    p, x = map(int, input().split())
    print(s + x - ts[p - 1])

Solution (Python):
N = int(raw_input())
line = map(int,raw_input().split(' '))
M = int(raw_input())
for i in range(M):
    x = map(int,raw_input().split(' '))
    s = sum(line)-(line[x[0]-1]-x[1])
    print s

Solution (Python):
from sys import stdin
n = int(stdin.readline())
a = [0] + map(int,stdin.readline().split())
m = int(stdin.readline())
s = sum(a)
for _ in xrange(m):
 x,y = map(int,stdin.readline().split())
 print s  + y - a[x]

Solution (Python):
n = input()
t = map(int,raw_input().split())
m = input()
tot = reduce(lambda x,y: x+y,t)
for d in xrange(m):
    temp = tot
    p,x = map(int,raw_input().split())
    temp -= t[p-1]
    temp += x
    print temp

Solution (Python):
N = int(input())
T = list(map(int, input().split(" ")))

M = int(input())
X = []
for _ in range(M):
    x_list = list(map(int, input().split(" ")))
    X.append(x_list)

T_sum = sum(T)
for (i, x) in X:
    i -= 1
    diff = T[i] - x
    print(T_sum - diff)

Solution (Python):
N = input()
t = input().split()
T = [int(i) for i in t]
S = sum(T)
M = int(input())
for i in range(0, M):
    N = input().split()
    print(S - T[int(N[0]) - 1] + int(N[1]))

Solution (Python):

N = int(input())
time_list = input().split()

time_list = [int(i) for i in time_list]
M = int(input())

i = 0
while i < M:
    time_i = time_list
    P_i, X = map(int, input().split())
    P_i_original = time_list[P_i - 1]
    time_i[P_i - 1] = X
    result = sum(time_i)
    time_list[P_i - 1] = P_i_original
    print(result)
    i +=1

Solution (Python):
n = int(input())
t = list(map(int, input().split()))
m = int(input())
while(m):
	p, x = map(int, input().split())
	print(sum(t)-t[p-1]+x)
	m -= 1

Solution (Python):
from sys import stdin

n=int(input())
temps=list(map(int,stdin.readline().split()))
total=sum(temps)
m=int(input())

for i in range(m):
    prob,tBoisson=map(int,stdin.readline().split())
    actu=total-temps[prob-1]+tBoisson
    print(actu)

Solution (Python):
N = int(input())
Ts = list(map(int, input().split()))
M = int(input())
for i in range(M):
    Ts2 = Ts[:]
    line = list(map(int, input().split()))
    Ts2[line[0]-1] = line[1]
    print(sum(Ts2))

Solution (Python):
n=int(input())
t=input().split()
m=int(input())
for i in range(m) :
    p,x=input().split()    
    sum=0
    for i in range(n) :
        if i==int(p)-1 :    sum=sum+int(x)
        else :   sum=sum+int(t[i])
    print(sum)

Solution (Python):



n = input()
ti = input().split()
sum_ti = sum(map(int, ti))

m = input()
for m in range(int(m)):
    px = input().split()
    sum_p = sum_ti - int(ti[int(px[0])-1]) + int(px[1])
    print(sum_p)

Solution (Python):
n = int(input())
li = [0] * n
li = list(map(int, input().split()))
result = sum(li)

m = int(input())

for i in range(m) :
  a,b = map(int, input().split())
  print(result - li[a-1] + b)

Solution (Python):
n = int(input())
li = [0] * n
li = list(map(int, input().split()))
result = sum(li)

m = int(input())
r1 = [0] * m
r2 = [0] * m

for i in range(m) :
  a,b = map(int, input().split())
  print(result - li[a-1] + b)

Solution (Python):
N = int(input())
T_res = list(map(int,input().split()))
M = int(input())
PX = []
for i in range(M):
      PX.append(input().split())
      PX[i][0] = int(PX[i][0])
      PX[i][1] = int(PX[i][1])

for i in range(M):
      org = T_res[PX[i][0]-1]
      T_res[PX[i][0]-1] = PX[i][1]
      print(sum(T_res))
      T_res[PX[i][0]-1] = org

Solution (Python):
n = int(input())
t = list(map(int, input().split()))
m = int(input())

i = 0
while i < m:
    p = list(map(int, input().split()))
    tn = t[:]
    tn[p[0] - 1] = p[1]
    total = sum(tn)
    print(str(total))
    i += 1

Solution (Python):
N = int(raw_input())
T = list(map(int, raw_input().split(' ')))
M = int(raw_input())

x_p = []
for i in range(M):
    x_p.append(map(int, raw_input().split(' ')))

sum = sum(T)

for i in range(M):
    print(sum-T[x_p[i][0]-1]+x_p[i][1])

Solution (Python):
n = int(input())
t = list(map(int,input().split()))
m = int(input())
origin,ans = [],[]

for _ in range(m):
	p,x = map(int,input().split())
	origin.append(t[p-1])
	t[p-1] = x
	ans.append(sum(t))
	t[p-1] = origin[0]
	origin = []

for i in range(m):
	print(ans[i])

Solution (Python):
n=int(input())
t=[int(i) for i in input().split()]
max=sum(t)
m=int(input())
sum_list=[]
for i in range(m):
    index,value=[int(j) for j in input().split()]
    index-=1
    temp=t[index]
    t[index]=value
    sum_list.append(sum(t))
    t[index]=temp
for i in sum_list:
    print(i)

Solution (Python):
n = input()
ti = map(int, raw_input().split())

m = input()
xi = []
for i in range(m):
	xi.append(map(int, raw_input().split()))

for i in range(len(xi)):
	p = xi[i][0]
	x = xi[i][1]
	s = 0
	for j in range(n):
		if(j == p-1):
			s += x
		else:
			s += ti[j]
	print s

Solution (Python):
N=int(raw_input())
T=map(int, raw_input().split())
M=int(raw_input())
for i in xrange(M):
    p, x = map(int, raw_input().split())
    ans = 0
    for j in xrange(N):
        if j+1 == p:
            ans += x
        else:
            ans += T[j]
    print ans

Solution (Python):
n = int(input())
t = list(map(int, input().split()))
m = int(input())

for i in range(m):
    p, x = map(int, input().split())
    res = t.copy()
    res[p-1] = x
    print(sum(res))

Solution (Python):
N = input()
T = list(map(int, input().split()))
M = int(input())
sumT = sum(T)
for i in range(M):
    P, X = map(int, input().split())
    print(sumT - T[P-1] + X)

Solution (Python):
n = int(input().rstrip())
t_list = input().rstrip().split()
t_list = [int(x) for x in t_list]
m = int(input().rstrip())

tmp_list = t_list

for i in range(m):
    line = input().rstrip().split()
    line = [int(x) for x in line]
    before = tmp_list[line[0]-1]
    val = line[1]

    tmp_list[line[0]-1] = val

    print(sum(tmp_list))

    tmp_list[line[0]-1] = before

Solution (Python):
n = int(input())
t_lst = [int(x) for x in input().split()]
m = int(input())
px_lst = [tuple(int(x) for x in input().split()) for _ in range(m)]

total_time = sum(t_lst)

for i in range(m):
    p, x = px_lst[i]
    print(total_time - t_lst[p - 1] + x)

Solution (Python):


import sys

def main(argv):
    n = sys.stdin.readline().rstrip()

    while n:
        t = [int(i) for i in raw_input().split()]
        m = int(raw_input())
        total = sum(t)
        for i in xrange(1, m + 1):
            p, x = [int(j) for j in raw_input().split()]
            print total - t[p - 1] + x

        n = sys.stdin.readline().rstrip()

if __name__ == "__main__":
    main(sys.argv)

Solution (Python):
n = int(raw_input())
T = map(int,raw_input().split())

m = int(raw_input())
ans = 0
for i in xrange(0, m):
    p,x = map(int,raw_input().split())
    temp = T[p-1]
    T[p-1] = x
    print sum(T)
    T[p-1] = temp

Solution (Python):
N = int(input())
T = list(map(int,input().split()))
M = int(input())
px = list()

for i in range(M):
    px.append(list(map(int,input().split())))

for i in range(M):

    ans = sum(T) - (T[px[i][0]-1] - px[i][1])
    print(ans)

Solution (Python):
N = int(input())
sT = input().split()
T = []
P = []
X = []
for i in range(N):
    T.append(int(sT[i]))
M = int(input())
for i in range(M):
    PX = input().split()
    P.append(int(PX[0]))
    X.append(int(PX[1]))


total = sum(T)
for i in range(M):
    print(total - T[P[i] - 1] + X[i])

Solution (Python):
N=int(input())
T=[int(i) for i in input().split()]
M=int(input())
k=[]
for i in range(M):
 PX=[int(j) for j in input().split()]
 k.append(sum(T)-T[PX[0]-1]+PX[1])
for i in k:
 print(i)

Solution (Python):
N = int(input())
T = list(map(int, input().split()))
max = sum(T)
M = int(input())
for i in range(M):
    P, X = map(int, input().split())
    diff = X - T[P - 1]
    print(max + diff)

Solution (Python):
n = int(input())
t = list(map(int, input().split(' ')))
m = int(input())
drinks = [list(map(int, input().split(' '))) for _ in range(m)]

for drink in drinks:
    total = 0
    for i in range(n):
        if i+1 != drink[0]:
            total += t[i]
        else:
            total += drink[1]
    print(total)

Solution (Python):
N = int(input())
T = list(map(int, input().split()))
M = int(input())
for i in range(M):
    P, X = map(int, input().split())
    print(sum(T[:P-1]) + X + sum(T[P:]))

Solution (Python):
N=int(raw_input().split()[0])
T=map(int,raw_input().split())
M=int(raw_input().split()[0])
S=sum(T)

for _ in range(0,M):
    p,x=map(int,raw_input().split())
    print S-T[p-1]+x

Solution (Python):

import math
import string
import time
import fractions



n = int(raw_input())
t = map(int, raw_input().split())
m = int(raw_input())
p = []
for i in range(m):
	p.append(map(int, raw_input().split()))

ret = 0
su = sum(t)
for i in p:
	print su - (t[i[0] - 1] - i[1])

Solution (Python):
n = input()
t = map(int, raw_input().split())
s = sum(t)

m = input()
for i in range(m):
	p, x = map(int, raw_input().split())
	print s - t[p - 1] + x

Solution (Python):
n=int(input())
t=[int(i) for i in input().split()]
m=int(input())
for i in range(m):
    tc=t[:]
    p,x=map(int,input().split())
    tc[p-1]=x
    print(sum(tc))

Solution (Python):
n = int(input())
t = [int(x) for x in input().split()]
m = int(input())
for i in range(m):
    p = [int(x) for x in input().split()]
    ans = sum(t)-t[p[0]-1]+p[1]
    print(ans)

Solution (Python):

N = int(input())
T = list(map(int, input().split()))
M = int(input())

P, X = list(), list()

for m in range(M):
    p, x = list(map(int, input().split()))
    P.append(p)
    X.append(x)

ans = sum(T)

for m in range(M):
    arg = P[m] - 1
    val = X[m]

    print(ans - T[arg] + val)

Solution (Python):
n = int(raw_input())
t = [int(x) for x in raw_input().split()]
m = int(raw_input())

s = sum(t)

for i in range(m):
    p, x = [int(z) for z in raw_input().split()]
    print s - t[p - 1] + x