#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;

typedef modint998244353 mint;
typedef long long ll;

void solve(vector<int> &dp){
	int a, b; cin >> a >> b;
	
	int x = 0;
	if (a <= 100) x ^= dp[a];
	else x ^= dp[a % 34 + 68];
	if (b <= 100) x ^= dp[b];
	else x ^= dp[b % 34 + 68];

	if (x > 0) cout << "First\n";
	else cout << "Second\n";
}

int main(){
	int mx = 150;
	vector<int> dp(mx+1);
	for (int i=4; i<mx+1; i++){
		set<int> r;
		for (int j=2; j<=i-2; j++){
			r.insert(dp[j] ^ dp[i-j]);
		}
		int piv = 0;
		while(r.find(piv) != r.end()) piv++;
		dp[i] = piv;
		//cout << dp[i] << endl;
	}

	int t; cin >> t;
	while(t--) solve(dp);
}