#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int memo[120];

int grundy(int x) {
    if (x >= 100) {
        return grundy( x - (x-50)/34*34);
    }
    else {
        if (memo[x] != -1) return memo[x];
        set<int> mex;
        for (int i = 2; i <= x - 2; ++i) {
            mex.insert(grundy(i) ^ grundy(x-i));
        }
        int g = 0;
        while (mex.find(g) != mex.end()) g++;
        memo[x] = g;
        return g;
    }
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    for (int i = 0; i < 120; ++i) {
        memo[i] = -1;
    }
    int q; cin >> q;
    while (q--) {
        int a,b; cin >> a >> b;
        if (grundy(a) ^ grundy(b)) {
            cout << "First" << "\n";
        }
        else {
            cout << "Second" << "\n";
        }
    }
}