7
576460752303423487 2
82 9
101 104
10 21
31 10
0 1
10 30
 1
128817972817282999 327672410994637530
 66
7 0
5 7
1 3
3 2
3 5
0 6
1 2
0 7
4 5
4 7
5 1
2 0
4 0
0 5
3 6
7 3
6 0
5 2
6 6
1 7
5 6
2 2
3 4
2 1
5 3
4 6
6 2
3 3
100000000000 1000000000000000000
0 1
4 1
2 6
5 5
4 3
0 3
3 7
3 1
1 0
4 4
1000000000000000000 100000000000
7 6
4 2
7 5
1 6
6 1
2 7
7 7
6 7
2 4
0 2
2 5
7 2
0 0
5 0
5 4
7 4
6 4
0 4
1 1
6 5
1 4
2 3
1 5
7 1
6 3
3 0
 1
100000000000 100000000001
 1
23917 1000000000000000000

First
Second
Second
First
Second
Second
First
 First
 Second
Second
First
Second
First
Second
First
Second
Second
First
First
Second
Second
Second
First
First
Second
First
First
First
Second
First
Second
First
First
Second
First
First
First
Second
First
First
First
Second
Second
First
First
Second
First
First
Second
First
Second
First
First
First
First
Second
First
Second
First
First
Second
Second
Second
First
Second
Second
First
Second
First
Second
First
First
First
Second
 Second
 Second

import java.io.*; 
import java.util.*; 

public class e_mu implements Runnable {
	BufferedReader in; 
	PrintWriter out; 
	StringTokenizer st; 

	String next() {
		while (st == null || !st.hasMoreTokens()) {
			try {
				st = new StringTokenizer(in.readLine());
			} catch (Exception e) {}
		}
		return st.nextToken(); 
	}

	int nextInt() {
		return Integer.parseInt(next());
	}

	long nextLong() {
		return Long.parseLong(next());
	}

	double nextDouble() {
		return Double.parseDouble(next());
	}


	Map<St, Integer> mp; 

	class St implements Comparable<St> {
		long a, b; 
		public St(long a, long b) {
			this.a = a; 
			this.b = b; 
		}

		public int compareTo(St c) {
			if (a==c.a) return (int)(b-c.b); else return (int)(a-c.a); 
		}
	}

	public int win(long a, long b) {
		if (a<b) {
			long w=a; 
			a=b; b=w; 
		}
		if (b==0) {
			mp.put(new St(a, b), 0);
			return 0; 
		} 
		if (b==1) {
			mp.put(new St(a, b), 1);
			return 1; 
		}
		if (mp.containsKey(new St(a, b))) {
			return mp.get(new St(a, b));
		}

		int res = win(b, a % b);
		long p = b;
		while (p<=a) {
			res=(res|win(a-p, b)); 
			p*=b; 
		}

		mp.put(new St(a, b), res);
		return res; 
	}

	
	public void run() {
		try {
			in = new BufferedReader(new InputStreamReader(System.in));
			out= new PrintWriter(System.out);
				int t= nextInt(); 
				mp = new TreeMap<St,Integer>(); 
				for (int i=0; i<t; i++) {
					long aa = nextLong(); 
					long bb = nextLong(); 
					if (win(aa, bb)==1) {
						out.println("First");
					} else out.println("Second");
				}


			out.close(); 
		} catch (Exception e) {
			System.out.println(e.toString());
		}
	}

	public static void main(String[] args) throws Exception {
		new Thread(new e_mu()).start();
	}
}