#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    ll n=1000;//cin >> n;
    vl dp(n);dp[2]=0;dp[3]=0;
    for(ll i=4;i<n;i++){
        set<ll> st;
        for(ll j=2;j<i-1;j++){
            st.insert(dp[j]^dp[i-j]);
        }
        rep(j,10000){
            if(st.count(j))continue;
            dp[i]=j;break;
        }
    }
    ll t;cin >> t;
    while(t--){
        ll a,b;cin >> a >> b;
        ll f=0;
        if(a<1000)f=dp[a];
        else {
            a%=35;a+=700;f=dp[a];
        }
        ll g=0;
        if(b<1000)g=dp[b];
        else {
            b%=35;b+=700;g=dp[b];
        }
        cout << ((f^g)? "First":"Second") << endl;

    }
    //rep(i,n)cout << dp[i] <<" ";cout << endl;
}