You are given two integers $a$ and $b$. Print $a+b$.


-----Input-----

The first line contains an integer $t$ ($1 \le t \le 10^4$) — the number of test cases in the input. Then $t$ test cases follow.

Each test case is given as a line of two integers $a$ and $b$ ($-1000 \le a, b \le 1000$).


-----Output-----

Print $t$ integers — the required numbers $a+b$.


-----Example-----
Input
4
1 5
314 15
-99 99
123 987

Output
6
329
0
1110

Difficulty: interview

Starter code:

Solutions:
for _ in range(int(input())):
    ar = list(map(int, input().split()))
    print(ar[0] + ar[1])

import sys
import math
import itertools
import functools
import collections
import operator
import fileinput
import copy

ORDA = 97       #a
def ii(): return int(input())
def mi(): return map(int, input().split())
def li(): return [int(i) for i in input().split()]
def lcm(a, b): return abs(a * b) // math.gcd(a, b)
def revn(n): return str(n)[::-1]
def dd(): return collections.defaultdict(int)
def ddl(): return collections.defaultdict(list)
def sieve(n):
    if n < 2: return list()
    prime = [True for _ in range(n + 1)]
    p = 3
    while p * p <= n:
        if prime[p]:
            for i in range(p * 2, n + 1, p):
                prime[i] = False
        p += 2
    r = [2]
    for p in range(3, n + 1, 2):
        if prime[p]:
            r.append(p)
    return r
def divs(n, start=1):
    r = []
    for i in range(start, int(math.sqrt(n) + 1)):
        if (n % i == 0):
            if (n / i == i):
                r.append(i)
            else:
                r.extend([i, n // i])
    return r
def divn(n, primes):
    divs_number = 1
    for i in primes:
        if n == 1:
            return divs_number
        t = 1
        while n % i == 0:
            t += 1
            n //= i
        divs_number *= t
def prime(n):
    if n == 2: return True
    if n % 2 == 0 or n <= 1: return False
    sqr = int(math.sqrt(n)) + 1
    for d in range(3, sqr, 2):
        if n % d == 0: return False
    return True
def convn(number, base):
    newnumber = 0
    while number > 0:
        newnumber += number % base
        number //= base
    return newnumber
def cdiv(n, k): return n // k + (n % k != 0)


for _ in range(ii()):
    print(sum(mi()))

import math,sys
from sys import stdin, stdout
from collections import Counter, defaultdict, deque
input = stdin.readline
I = lambda:int(input())
li = lambda:list(map(int,input().split()))

def case():
    a,b=li()
    print(a+b)
for _ in range(int(input())):
    case()

def solve(n,k):
    return n+k

t = int(input())
for i in range(t):
    n,k = tuple(map(int,input().split()))
    print(solve(n,k))


# Template 1.0
import sys, re, math
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(list(passedDic.items()), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

t = INT()

while (t != 0):
    n, m = MAP()

    print(n+m)
    t -= 1




t = int(input())
for i in range(t):
    a, b = map(int, input().split())
    print(a + b)

#dt = {} for i in x: dt[i] = dt.get(i,0)+1
#dt = {k:v for k,v in sorted(x.items(), key=lambda i: i[1])}
ipnl = lambda n: [int(input()) for _ in range(n)]
inp = lambda :int(input())
ip = lambda :[int(w) for w in input().split()]
mp = lambda :map(int,input().split())

for _ in range(int(input())):
    a,b = mp()
    print(a+b)

'''
    Auther: ghoshashis545 Ashis Ghosh
    College: jalpaiguri Govt Enggineerin College
    Date:07/05/2020

'''
from collections import deque
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itertools import permutations
from datetime import datetime
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input()
def mi():return map(int,input().split())
def li():return list(mi())


abc='abcdefghijklmnopqrstuvwxyz'
abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
mod=1000000007
#mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]



    
def solve():
    
    
    
    
    for _ in range(ii()):
        a,b=mi()
        print(a+b)
    
    
    
        
            
        
    
    
    
    
    
    
    
    
    
    
    
    
    
def __starting_point():
    solve()
__starting_point()

from sys import stdin, exit
input = stdin.readline

def i(): return input()
def ii(): return int(input())
def iis(): return list(map(int, input().split()))
def liis():	return list(map(int, input().split()))
def print_array(a): print(" ".join(map(str, a)))

t = ii()
for _ in range(t):
	a, b = iis()	
	print(a+b)


t = int(input())
for _ in range(t):
    a, b = map(int, input().split())
    print(a + b)

t=int(input())
for i in range(t):
	a,b=map(int,input().split())
	print(a+b)

for _ in range(int(input())):
    a,b=[int(i) for i in input().split()]
    print(a+b)

for _ in range(int(input())):
    a,b = list(map(int,input().split()))
    print(a+b)

t=int(input())
for _ in range(t):
  a,b=map(int,input().split())
  print(a+b)

t=int(input())
for i in range(t):
    b=list(map(int,input().split()))
    print(b[0]+b[1])



def s():
    a,b = map(int,input().split(" "))
    print(a+b)
            
t = int(input())
for i in range(t):
    s()

t = int(input())
for i in range(t):
    a, b = list(map(int, input().split()))
    print(a + b)

for _ in range(int(input())):
    a,b=map(int,input().split())
    print(a+b)

for ii in range(int(input())):
	a, b = list(map(int , input().split()))
	print(a+b)


n=int(input())

for i in range(n):
    p,q=list(map(int,input().split()))
    print(p+q)
                                       


t=int(input())
for i in range(t):
    a,b=map(int,input().split())
    print(a+b)

for _ in range(int(input())):
    # n = int(input())
    n,k =map(int,input().split())
    print(n+k)