Backwards Long Addition The standard long addition method:


  The standard algorithm for adding multidigit numbers is to align the addends vertically and add the columns, starting from the ones column on the right. If a column exceeds ten, the extra digit is "carried" into the next column. (wikipedia)


A long addition example:

 145
+ 98
-----
 243


Backwards long addition is similar but you start adding from the leftmost column and carry to the next column (on it's right). If the last (ones) column produces a carry you write it behind the current sum in the next column. If there is no carry in the last column no extra column is needed.

 145
+ 98
-----
 1341


Explanation for the above example by columns, left to right: 1 = 1; 4+9 = 10(carried) + 3; 5+8+1(carry) = 10(carried) + 4; 1(carry) = 1

You should write a program or function which receives two positive integers as input and returns their sum using backwards long addition.

Input


Two positive integers.


Output


An integer, the sum of the two input numbers using backwards long addition.
There should be no leading zeros. (Consider 5+5=1 or 73+33=7.)


Examples

Format is Input =&gt; Output.

1 3 =&gt; 4          
5 5 =&gt; 1          
8 9 =&gt; 71         
22 58 =&gt; 701      
73 33 =&gt; 7        
145 98 =&gt; 1341    
999 1 =&gt; 9901     
5729 7812 =&gt; 26411
Pyth, 16 bytes
Still new to Pyth, but this looks promising..
s_`smvs.[_d0lzcz

The idea here is simple. To do backwards addition, you need backwards numbers. We take the input, reverse it, make sure that it has same number of digits be adding trailing 0, sum the two numbers, reverse it again and make sure no leading zero exists.
Code expansion
              cz          # Take the input and Python split it. Splits on space automatically
    m                     # Now we map over these two strings
         _d               # Reverse the string
       .[  0lz            # Pad it with 0 on right so that its length is same as input length
     vs                   # We have array of character and number, stringify and eval
   s                      # Sum the numbers in array
  `                       # Stringify
 _                        # Reverse
s                         # Convert back to number, removing leading 0

Try it online here