P13361 [CodeChef] cmb01
NOI
题目描述

Reversed number is a number written in arabic numerals but the order of digits is reversed.

The first digit becomes last and vice versa. For example, if the number is 1245,it will become

5421 .Note that all the leading zeros are omitted. That means if the number ends with a zero,

the zero is lost by reversing (e.g. 1200 gives 21). Also note that the reversed number never has

any trailing zeros. Your task is to add two reversed numbers and output their reversed sum. Of

course, the result is not unique because any particular number is a reversed form of several

numbers (e.g. 21 could be 12, 120 or 1200 before reversing). Thus we must assume that no zeros

were lost by reversing (e.g. assume that the original number was 12).

Input

The input consists of N cases (equal to about 10000). The first line of the input contains

only positive integer N. Then follow the cases. Each case consists of exactly one line with

two positive integers separated by space. These are the reversed numbers you are to add.

Output

For each case, print exactly one line containing only one integer - the reversed sum of

two reversed numbers. Omit any leading zeros in the output.

Example

Input:
1
24 1

Output:
34

输入格式

见题面

输出格式

见题面

样例输入
1 24 1
样例输出
34