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 long double pi = acos(-1.0);
const int inf = 1000 * 1000 * 1000;
const long long inf64 = long long(inf) * inf;
map<pair<long long, long long>, int> dp;
int get(long long a, long long b) {
  if (a > b) swap(a, b);
  int &res = dp[make_pair(a, b)];
  if (res != 0)
    return res;
  else if (a == 0)
    return res = -1;
  else {
    int r1 = get(b % a, a);
    if (r1 < 0)
      res = 1;
    else if (a & 1) {
      if ((b / a) % 2 == 0)
        res = 1;
      else
        res = -1;
    } else {
      if ((b % (a + 1)) % 2 == 0)
        res = 1;
      else
        res = -1;
    }
  }
  return res;
}
int go(vector<int> &s, vector<long long> &p, int cur) {
  if (s[cur]) return s[cur];
  for (int i = 0; i < p.size(); ++i)
    if (p[i] <= cur)
      if (go(s, p, cur - p[i]) < 0) return s[cur] = 1;
  return s[cur] = -1;
}
int main() {
  clock_t _clock = clock();
  ;
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    long long a, b;
    cin >> a >> b;
    int res = get(a, b);
    if (res > 0)
      cout << "First\n";
    else
      cout << "Second\n";
  }
  cerr << (clock() - _clock) / (long double)CLOCKS_PER_SEC;
  ;
  return (EXIT_SUCCESS);
}
