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
ouosvavv:
20160819 21:14:55
You can tell a problem is too easy when this comment has 11 character less than my entire code in PHP which has 138 characters. 

shrutivtu:
20160819 07:25:01
AC in first attempt too easy.... 

dixitgaurav97:
20160807 15:32:49
http://www.spoj.com/status/ns=17454931 

cnexans:
20160726 06:03:07
AC in the first try. Elementary number theory :) 

dinesh_singh:
20160707 21:36:26
Last edit: 20160707 21:36:46 

shashisuman:
20160628 23:33:32
NZEC is exception...try catch in java will solve it 

shashisuman:
20160628 23:32:39
All of you.....1000 001 is 2....verified its 2..AC in 3rd go coz earlier both were giving 101 

Lauro Moura:
20160616 19:36:07
Nothing like seeing "running..." and realizing you forgot to remove the debugging messages, resulting in WA... 

amit_taps1997:
20160603 19:36:34
AC in 2nd Go.Remember newline 

top_gun007:
20160522 13:06:53
f***** easy 
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 