#line 2 "/home/cocojapanpan/Procon_CPP/proconLibrary/lib/template/procon.hpp"

#ifndef DEBUG
// 提出時にassertはオフ
#ifndef NDEBUG
#define NDEBUG
#endif
// 定数倍高速化
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define ALL(x) (x).begin(), (x).end()
template <class T>
using vec = vector<T>;
template <class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}
template <class T>
constexpr T INF = 1'000'000'000;
template <>
constexpr int INF<int> = 1'000'000'000;
template <>
constexpr ll INF<ll> = ll(INF<int>) * INF<int> * 2;
#line 2 "main.cpp"

int grundy[110];

int getGrundy(ll a) {
    if(2 <= a && a <= 54) {
        return grundy[a];
    }
    int num = (a - 55) % 34;
    return grundy[num + 55];
}

// 先手が勝つならtrueを返す
bool solve() {
    ll a, b;
    cin >> a >> b;
    return (getGrundy(a) ^ getGrundy(b)) > 0;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    for(int i = 4; i <= 100; i++) {
        unordered_set<int> numset;
        for(int j = 2; j <= i / 2; j++) {
            numset.insert(grundy[j] ^ grundy[i - j]);
        }
        for(int j = 0; j <= 100; j++) {
            if(numset.count(j)) continue;
            grundy[i] = j;
            break;
        }
    }
    for(int i = 0; i < T; i++) {
        cout << (solve() ? "First" : "Second") << "\n";
    }
}