n = 34; g = [0]*3*n
for i in range(4,3*n):
    s = set()
    for j in range(2,i-1): s.add(g[j]^g[i-j])
    for j in range(3*n+1):
        if j not in s: g[i] = j; break
for _ in range(int(input())):
    a,b = map(int,input().split())
    print("First" if g[min(a,a%n+2*n)]^g[min(b,b%n+2*n)] else "Second")