| Problem description |
|
We are not alone. In the year 3000, scientists have eventually found another planet which has intelligent being living on. Let's say, Planet X. And we call the intelligent being there ‘XMen'. To learn advanced technology from Planet X, we want to exchange information with XMen. Unfortunately, XMen use a very strange data format when sending message, which is called m-encoding (m is for multiplication). Scientists on earth have successfully found out the algorithm of m-encoding, defining as following: For each data package from XMen, there are two non-negative integer numbers, A and B. And the actual data XMen want to send is the product of A and B (A * B). So, in this problem, you are to implement a decoder for data packages from XMen. |
| Input |
| There are multiple test cases. Input data starts with an integer N, indicating the number of test cases.
Each test case occupies just one line, and contains two non-negative integers A and B (0 <= A, B <= 101000000), separated by just one space. |
| Output |
| For each test case, output the actual data XMen want to send, one in a line. |
| Sample Input |
3 1 1 100 123 12345678901234567890 54321 |
| Sample Output |
1 12300 670629623593962962352690 |
[求助] 10的1000000方怎么弄？
题目：
