CSES - Aalto Competitive Programming 2024 - wk8 - Wed - A TIMES B!
  • Time limit: 1.00 s
  • Memory limit: 512 MB

You are given two numbers aa and bb in base 10. Calculate a×ba \times b.

Hint: multiplication can be done with convolutions. Convolutions are fast to calculate with NTT or FFT.

Input

The input consists of two lines. First one contains the integer aa and the second bb.

Output

Print a×ba \times b in base 10 with no leading zeros.

Constraints

  • 1a,b101061 \leq a, b \leq 10^{10^6}
  • Python's integer multiplication is too slow for this.

Example 1

Input:

7
191

Output:

1337

Example 2

Input:

9641697369926504411
425970950212942028697061039529593907438336514

Output:

4107082990333217112168128101740006210847052817050776156723363254