We have the following matrix 
1 0 0 0 0 0 ...
2 2 0 0 0 0 ...
3 3 3 0 0 0 ...
4 4 4 4 0 0 ... 
5 5 5 5 5 0 ... 
6 6 6 6 6 6 ...
and so on ... 

The matrix is created as follows, first row contains one 1 and rest 0's, second row contains 2 twos and rest zeros, third row contains 3 threes and so on.

Given R and C, calculate the count of even and odd numbers in sub matrix [R,C] .
0 is neither odd nor even and 1 based indexing is used i.e. matrix [1,1]=1 

Input:
First line contains number of test cases T.Each test case contains two integers R and C.

Output
For each test case print count of even and odd numbers in sub matrix [R,C].

Constraints:
1 ≤ T ≤ 100000  
1 ≤ R ≤ 100000 
1 ≤ C ≤ 100000  

SAMPLE INPUT
3
2 3
6 7
10 10

SAMPLE OUTPUT
2 1
12 9
30 25
tc = int(raw_input())
if 1<=tc<=100000:
    for i in range(tc):
        r,c = raw_input().split()
        r,c = int(r),int(c)
        if 1<=r<=100000 and 1<=c<=100000:
        	if r == 1:
        		print 0,1
        		continue
        	if c == 1:
        		print c/2,(c/2)+1
        		continue
        	even,odd = 0,0
        	if r<=c:
        		row = r/2
        		even =  2*row*(row+1)/2
        		odd = r*(r+1)/2 - even
        	else:
        		row = c/2
        		even =  2*row*(row+1)/2
        		odd = c*(c+1)/2 - even
        		n = r-c
        		if n%2 == 0:
        			even = even + (c*(n/2))
        			odd = odd + (c*(n/2))
        		if n%2 and r%2:
        			even = even + ((n/2)*c)
        			odd = odd + ((n- (n/2))*c)
        		if n%2 and not(r%2):
        			odd = odd + ((n/2)*c)
        			even = even + ((n- (n/2))*c)
        	
        	print even,odd