import math
 
tc = int(input())
 
def pw(a, b):
    res = 1
    while b > 0: 
        if b % 2 == 1: res = res * a 
        a = a * a 
        b = b // 2
    return res
 
def solve():
    n, k = map(int, input().split())
    a, b = (k-n+1)*pw(k+1,n-1), pw(k,n)
 
    t = math.gcd(a, b)
    a = a // t
    b = b // t
    print(a, b)
 
for i in range(0,tc):
    solve()
				aW1wb3J0IG1hdGgKCnRjID0gaW50KGlucHV0KCkpCgpkZWYgcHcoYSwgYik6CiAgICByZXMgPSAxCiAgICB3aGlsZSBiID4gMDogCiAgICAgICAgaWYgYiAlIDIgPT0gMTogcmVzID0gcmVzICogYSAKICAgICAgICBhID0gYSAqIGEgCiAgICAgICAgYiA9IGIgLy8gMgogICAgcmV0dXJuIHJlcwoKZGVmIHNvbHZlKCk6CiAgICBuLCBrID0gbWFwKGludCwgaW5wdXQoKS5zcGxpdCgpKQogICAgYSwgYiA9IChrLW4rMSkqcHcoaysxLG4tMSksIHB3KGssbikKCiAgICB0ID0gbWF0aC5nY2QoYSwgYikKICAgIGEgPSBhIC8vIHQKICAgIGIgPSBiIC8vIHQKICAgIHByaW50KGEsIGIpCgpmb3IgaSBpbiByYW5nZSgwLHRjKToKICAgIHNvbHZlKCk=
				
				
				
				
				
			 
			
				
			
			
				
NDAgCjEgNiAKMSA3IAoxIDggCjEgOSAKMSAxMCAKMiA2IAoyIDcgCjIgOCAKMiA5IAoyIDEwIAozIDYgCjMgNyAKMyA4IAozIDkgCjMgMTAgCjQgNiAKNCA3IAo0IDggCjQgOSAKNCAxMCAKNSA2IAo1IDcKNSA4IAo1IDkgCjUgMTAgCjYgNiAKNiA3IAo2IDggCjYgOSAKNiAxMCAKNyA3IAo3IDggCjcgOSAKNyAxMCAKOCA4IAo4IDkgCjggMTAgCjkgOSAKOSAxMCAKMTAgMTAg
40 
1 6 
1 7 
1 8 
1 9 
1 10 
2 6 
2 7 
2 8 
2 9 
2 10 
3 6 
3 7 
3 8 
3 9 
3 10 
4 6 
4 7 
4 8 
4 9 
4 10 
5 6 
5 7
5 8 
5 9 
5 10 
6 6 
6 7 
6 8 
6 9 
6 10 
7 7 
7 8 
7 9 
7 10 
8 8 
8 9 
8 10 
9 9 
9 10 
10 10