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
t=int(input())
import math
while(t>0):
	r,c=map(int,raw_input().split())
	if(r<=c):
		x=r/2
		even=x*(2+(x-1))
		x=r-x
		odd=x*(1+(x-1))
		print even,odd
	else:
		x=r/2
		even=x*(2+(x-1))
		x=r-x
		odd=x*(1+(x-1))
		r=r-c
		if(c%2==0):
			x=r/2
			even=even-x*(2+(x-1))
			x=r-x
			odd=odd-x*(1+(x-1))
		else:	
			x=r/2
			odd=odd-x*(2+(x-1))
			x=r-x
			even=even-x*(1+(x-1))
		print even,odd
		
		
	t-=1