- Time limit: 1.00 s
- Memory limit: 512 MB
You are given two numbers. Print their product modulo 10^{9} + 7.
Input
The only line of input contains two integers a and b.
Output
Print a \cdot b modulo 10^{9} + 7.
Constraints
- 1 \leq a, b \leq 10^{18}
Example 1
Input:
3 5
Output:
15
Example 2
Input:
999999999999999952 999999999999999952
Output:
1