ADDREV  Adding Reversed Numbers
The Antique Comedians of Malidinesia prefer comedies to tragedies. Unfortunately, most of the ancient plays are tragedies. Therefore the dramatic advisor of ACM has decided to transfigure some tragedies into comedies. Obviously, this work is very hard because the basic sense of the play must be kept intact, although all the things change to their opposites. For example the numbers: if any number appears in the tragedy, it must be converted to its reversed form before being accepted into the comedy play.
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 main hero had 1245 strawberries in the tragedy, he has 5421 of them now. 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.
ACM needs to calculate with reversed numbers. 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
Sample input: 3 24 1 4358 754 305 794 Sample output: 34 1998 1
hide comments
saddy_2001:
20200423 01:24:13
easy implementation with ' stol ' function. AC on first go !


jorson:
20200328 06:22:42
Well, first AC xP 

abdo_farah:
20200204 15:49:28
AC in one go ,EZ 

shammianand:
20200119 12:39:10
AC in 1st attempt!! Nice. 

sandipan2224:
20191202 18:04:02
AC in 1st attempt!!! wohoo


legion0retr0:
20191027 11:42:26
Looks like sample IO is wrong for second case ! 

karan_takalkar:
20191012 06:28:38
solved it with string stream!! 

deerawat:
20190912 20:07:04
finally solved my first problem in spoj.....in 3rd go


tuleaux:
20190809 17:06:35
AC in one go hehe 

bose_ftw_1:
20190808 03:59:22
was doing in c++.... scratched my head as to why WA was refecting.... always try to make sure you cout an endl after every test case even if it isn't explicitly mentioned. 
Added by:  adrian 
Date:  20040606 
Time limit:  5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  ACM Central European Programming Contest, Prague 1998 