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
import sys
raw_input()
for val in sys.stdin:
    r=int(val.split()[0])
    c=int(val.split()[1])
    if r==1 :
        print 0,1
    elif r%2 :
        if c>=r:
            print ((r-1)/2 +1)*(r-1)/2,((r+1)/2)**2
        else:
            if not c%2 :
                y=r-c
                e=((r-1)/2 +1)*(r-1)/2
                o=((r+1)/2)**2
                e=e-((y-1)/2 +1)*(y-1)/2
                o=o-((y+1)/2)**2
                print e,o
            else :
                y=r-c
                e=((r-1)/2 +1)*(r-1)/2
                o=((r+1)/2)**2
                e=e-(y/2)**2
                o=o-(y/2+1)*(y/2)
                print e,o
    else:
        if c>=r:
            print (r/2+1)*(r/2),(r/2)**2
        else:
            if not c%2:
                y=r-c
                e=(r/2+1)*(r/2)
                o=(r/2)**2
                o=o-(y/2)**2
                e=e-(y/2+1)*(y/2)
                print e,o
            else:
                y=r-c
                e=(r/2+1)*(r/2)
                o=(r/2)**2
                e=e-((y+1)/2)**2
                o=o-((y-1)/2+1)*((y-1)/2)
                print e,o