LONGSUM - A + B Problem

A + B is an example of the easiest problem. However, sometimes this problem is not so easy to get accepted. Want to try?

A, B are very large numbers and contains only digits 0, 1, 2, 3, 4 and both numbers have equal length. A, B can have leading zeroes.

Input

The first line contains one integer T, the number of test cases (1 ≤ T ≤ 100). Each test case contains two numbers A and B (0 ≤ A, B ≤ 10^1000), separated by new line.

Output

For each test case print one line, the sum of the given numbers.

Example

Input:
3
14
14
331
442
12132123121320013203213032102310321
21033213202131320231320321320321432

Output:
28
773
33165336323451333434533353422631753

Added by:imranziad
Date:2016-04-07
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64 GOSU JS-MONKEY
Resource:Mokaddesh Rashid Shovon (ACC Beginners Contest)

© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.