e-olymp
favorite We need a little bit of your help to keep things running, click on this banner to learn more
Problems

Long sum

Long sum

Given two non-negative integers m and n. Find their sum.

Input

The first line contains m, the second line contains n (0m, n < 1030000).

Output

Print a sum without spaces or leading zeros.

Time limit 2 second
Memory limit 122.17 MiB
Input example #1
12345678901234567890123456789
1111111111111111111111111111
Output example #1
13456790012345679001234567900