Ramesh and Suresh are best friends. But they are fighting over money now. Suresh has given some money to Ramesh but he has forgotten how much money he had given. So Ramesh made a plan that he will give Re. 1 to every rectangle Suresh makes in a N x M area. Since Suresh is poor in mathematics he needs your help to make maximum possible rectangles in N x M area. You need to tell Suresh the maximum amount of money he can take back.

Input:
First line of the input contains T denoting the number of test cases. Then T lines follow each contains two integers N and M.

Output:
Output the required answer for each test case in a separate line.

Constraints:
1<=T<=10⁵
1<=N, M<=10⁴

Sample Input:

2
1 2
3 3

3
36

Test case: 2
3 x 3 area amount earned is Rs. 36

There are following:-
9 rectangles (1 x 1 area), 
6 rectangles (1 x 2 area), 
3 rectangles (1 x 3 area),
6 rectangles (2 x 1 area),
3 rectangles (3 x 1 area),
4 rectangles (2 x 2 area),
2 rectangles (2 x 3 area),
2 rectangles (3 x 2 area),
1 rectangle (3 x 3 area)