题号:NC15902
                        时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
            空间限制:C/C++/Rust/Pascal 32 M,其他语言64 M
             64bit IO Format: %lld
        
     
    题目描述
        
        
    
            
            There are many difficulties in today's contest, but this is definitely not one of them.
   Because I want you to do it, the classic A+B. 
   
 
输入描述:
                                                    First line an Integer N means n test cases.
Next 2N lines representing 2N groups of different Integers.
N<50.
THE LENGTH of every Integer will less than 5000.
All Integers will be greater than 0.
Some cases may have leading zero.
                                                                            输出描述:
                                                    One line for each test cases reprecenting the answer of A+B.
Do not putout leading zero
                                                                            
                        
                            示例1
                        
                        
                            
                                输入
                                复制
                                
                                
                                    1
100000000000000
100000000000000
                                 
                             
                            
                                                     
                     
                                                        备注:
                You do not have to use FFT.