Counting Unique Pairs

You are given T test cases. For each test case, you are provided two integers M and N which denote sizes of two departments. Your task is to count the number of unique pairs that can be formed between these two departments. The result for each test case is simply computed using the formula: \(M \times N\).

You need to read the input from standard input (stdin) and output the results to standard output (stdout), with each output in a new line.

inputFormat

The first line contains an integer T denoting the number of test cases. Each of the next T lines contains two space-separated integers M and N.

outputFormat

For each test case, output a single line containing the result of \(M \times N\).

3
3 4
1 5
2 2

12
5
4