#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	vector<int>grundy(200);
	grundy[2] = 0;
	grundy[3] = 0;
	rep2(i, 4, 200) {
		set<int>st;
		rep2(j, 2, i - 1) st.insert(grundy[j] ^ grundy[i - j]);
		rep(j, 10000) {
			if (!st.count(j)) {
				grundy[i] = j;
				break;
			}
		}
	}
	auto f = [&](int x)->int {
		// 55以降は34周期らしい
		if (x < 55)return grundy[x];
		return grundy[55 + (x - 55) % 34];
	};
	int t; cin >> t;
	while (t--) {
		int a, b; cin >> a >> b;
		int x = f(a) ^ f(b);
		if (x)cout << "First" << endl;
		else cout << "Second" << endl;
	}
	return 0;
}