#include <bits/stdc++.h>

using namespace std;

void solve(){
	int n;
		cin >> n;
		int a[n];
		for(int i = 0; i < n; ++i)
			cin >> a[i];
		sort(a, a + n);
		if(n & 1){
			cout << "Second\n";
		}else{
			// 1 2 4 5
			// 100
			// 101
			// 010
			// 001
			for(int i = 0; i < n; i += 2){
				if(a[i] != a[i + 1]){
					cout << "First\n";
					return;
				}
			}
			cout << "Second\n";
		}
}
int main()
{		
	int T;
	cin >> T;
	while(T--){
		solve();
	}
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
long long INF = 1LL<<60;
using ll = long long;
using vll = vector<ll>;
using mll = map<ll, ll>;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }

const string YES = "Yes";
const string NO = "No";

void solve(long long S, long long P){
    for(ll x = 1; x * x <= P; x++){
        if(P % x != 0) continue;
        if(P/x + x == S){
            cout << YES << endl; return;
        }
    }
    cout << NO << endl;
}

int main(){
    long long S;
    scanf("%lld",&S);
    long long P;
    scanf("%lld",&P);
    solve(S, P);
    return 0;
}
