Tudor is sitting in math class, on his laptop. Clearly, he is not paying attention in this situation. However, he gets called on by his math teacher to do some problems. Since his math teacher did not expect much from Tudor, he only needs to do some simple addition problems. However, simple for you and I may not be simple for Tudor, so please help him!

Input Specification

The first line will contain an integer ~N~ ~(1 \le N \le 1521)~, the number of addition problems Tudor needs to do. The next ~N~ lines will each contain two space-separated positive integers whose absolute value is less than or equal to ~10^1~, the two integers Tudor needs to add.

Output Specification

Output ~N~ lines of one integer each, the solutions to the addition problems in order.

Sample Input

1
1 1

Sample Output

2

Hints

The grader on this problem is special. You will get one mark per problem that you solve correctly. However, if your answers are deemed to be inconsistent, your solution will get zero marks. This mechanic is to incentivize people to understand the true nature of the problem.

Furthermore, since the input integers are all positive and less than or equal to ~10~, the output values must be between ~2~ and ~20~ for your solution to earn any marks.

Your code must not be longer than 1521 bytes.