{"trustable":false,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n #problem-body \u003e pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n","sections":[{"title":"","value":{"format":"MD","content":"\u003cdiv id\u003d\"problem-body\"\u003e\n \u003cp\u003eBUP Infotech Club members has decided to go to Qatar to enjoy the Football World Cup 2022 and meet their favorite players. Qatar\u0027s Native Language is Arabic. So the members decided to practice some Arabic Numbering System before their flight.\u003c/p\u003e\n\n \u003cp\u003eThe digit order is flipped in Arabic numerals. First digit changes to last digit, and vice versa. For instance, the Arabic equivalent of the number 1257 is 7521. The leading zeros are all missing, as you can see. This means that if a number ends in a zero, the zero is lost when the number is reversed (e.g. 1400 gives 41). Also take note that there are never any trailing zeros in the reversed number.\u003c/p\u003e\n\n \u003cp\u003eThe members now wishes to combine two reversed integers and display the result. Of course, the outcome is not singular because each number is the reversal of multiple other numbers (e.g. 41 could be 14, 140 or 1400 before reversing). Therefore, it must be considered that there were no zeros lost during the reversal (e.g. assume that the original number was 14).As a veteran member of BUPITC, it is up to you to teach other members to add the numbers.\u003c/p\u003e\n \u003ch3\u003eInput\u003c/h3\u003e\n \u003cp\u003eThere are N cases in the input (equal to about 10000). The input\u0027s first line only has the positive number N. Then each case contains exactly single line with two positive integers separated by spaces makes up each Test Case. You must add these digits in reverse.\u003c/p\u003e\n \u003ch3\u003eOutput\u003c/h3\u003e\n \u003cp\u003eFor each case, print exactly one line containing only one integer - the reversed sum of two reversed numbers. Omit any leading zeros in the output.\u003c/p\u003e\n \u003ch3\u003eExample\u003c/h3\u003e\n \u003cpre\u003eSample input: \n3\n24 1\n4358 754\n305 794\n\nSample output:\n34\n1998\n1\n\u003c/pre\u003e\n\u003c/div\u003e"}}]}