def f(n):
    if n > 84:
        return 4.0
    elif n > 79:
        return 3.5
    elif n > 74:
        return 3.0
    elif n > 69:
        return 2.5
    else:
        return 2.0


def min(n, k):
    if n < 70:
        return 2
    h = [69] * k
    while sum(h) < n * k:
        h.pop()
        h = [100] + h
    while sum(h) - 1 >= n * k:
        h[0] -= 1
    for i in range(k):
        h[i] = f(h[i])
    return (sum(h) / k)

def max(n, k):
    if n > 84:
        return 4
    h = [85] * k
    while sum(h) > n * k:
        h.pop()
        h = [60] + h
    while sum(h) + 1 <= n * k:
        h[0] += 1
    for i in range(k):
        h[i] = f(h[i])
    return (sum(h) / k)


a = int(input())
for i in range(a):
    i, j = map(int, input().split())
    print(min(i, j), max(i, j))