A Times BView as PDF
For a while now, has been thinking about fast multiplication. He found the problem on SPOJ, MUL, and solved it without too much trouble. Then he found VFMUL on the same site, but the same code for MUL didn't pass as the SPOJ servers were really slow. Frustrated and desperate to
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 .