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

#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-9;
const int inf = (1 << 30) - 1;
const long long inf64 = ((long long)1 << 62) - 1;
const long double pi = 3.1415926535897932384626433832795;
const string task = "";
template <class T>
T sqr(T x) {
  return x * x;
}
int solve(long long a, long long b) {
  long long w = (b / a) % (a + 1);
  return (w + 1) % 2;
}
int calc(long long a, long long b) {
  if (a > b) swap(a, b);
  if (a == 0) return 0;
  if (!calc(b % a, a)) return 1;
  if (solve(a, b - b % a)) return 1;
  return 0;
}
void solve() {
  long long a, b;
  cin >> a >> b;
  if (calc(a, b))
    puts("First");
  else
    puts("Second");
}
long long gen() {
  long long mod = 1e18;
  long long now = rand();
  now = (now << 48 | rand());
  now = (now % mod + mod) % mod;
  return now;
}
int main() {
  int tst;
  cin >> tst;
  for (int i = 0; i < (int)(tst); i++) {
    solve();
  }
  return 0;
}
