Category: Big Numbers
The problem is to multiply two integers X, Y. (0 ≤ X, Y < 10250)
There are at most 500 testcases. The input will consist of a set of pairs of lines. Each line in pair contains one multiplyer.
For each input pair of lines the output line should consist of one integer the product.