For a while now,
show off demonstrate his fast multiplication code, has created a problem that really tests the accuracy and speed of your fast multiplication code.
The first line of input will have .
The second line of input will have .
Both and will be non-negative integers strictly less than .
Output the product .