Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

The following languages are only available languages for the problems from the contest

Surprise Language Round #5:

- OpenCobol 1.0

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. A + B

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given two integers *A* and *B*. Calculate their sum and output it without leading zeros.

Input

Two lines of input data contain integers *A* and *B* (1 ≤ *A*, *B* ≤ 10^{5}).

Output

Output *A* + *B* without leading zeros.

Examples

Input

12

3

Output

15

Input

100

5

Output

105

Note

The code provided in the post about the round doesn't solve the task.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/20/2018 21:09:56 (d3).

Desktop version, switch to mobile version.

User lists

Name |
---|