memo = {}


def f(n):
    if n == 2 or n == 3:
        return 0
    if n in memo:
        return memo[n]

    se = set()
    for i in range(2, n):
        j = n - i
        if i > j:
            break
        se.add(f(i) ^ f(j))
    mex = 0
    while mex in se:
        mex += 1
    memo[n] = mex
    return mex


G = [0, 0]
for n in range(2, 102):
    G.append(f(n))


def g(n):
    minus = max(0, (n - 102) // 34 * 34)
    n -= minus
    while n >= len(G):
        n -= 34
    return G[n]


for _ in range(int(input())):
    a, b = map(int, input().split())
    if g(a) != g(b):
        print("First")
    else:
        print("Second")