#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define testcase  \
    ll tc, t = 1; \
    cin >> tc;
#define iloop(i, n) for (i = 0; i < n; i++)
#define dloop(i, n) for (i = n; i >= 0; i--)

#define fast                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);

#define vll vector<ll>

#define ipop                          \
    freopen("input.txt", "r", stdin); \
    freopen("output.txt", "w", stdout);

//#define MAX 1000000
vector<ll> Seiveprime(ll n)
{
    vector<bool> isPrime(n, true);
    for (int i = 2; i * i < n; i++)
    {
        if (isPrime[i])
        {
            for (int j = i * i; j < n; j += i)
                isPrime[j] = false;
        }
    }
    vector<ll> prime;
    prime.push_back(2);
    for (int i = 3; i < n; i += 2)
        if (isPrime[i])
            prime.push_back(i);
    return prime;
}
ll binpow(ll a, ll b)
{
    ll res = 1;
    while (b > 0)
    {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}
bool isPrime(int n)
{
    if (n <= 1)
        return false;
    if (n <= 3)
        return true;
    if (n % 2 == 0 || n % 3 == 0)
        return false;

    for (int i = 5; i * i <= n; i = i + 6)
        if (n % i == 0 || n % (i + 2) == 0)
            return false;

    return true;
}
ll lcm(ll a, ll b)
{
    ll x = __gcd(a, b);
    return (a * b) / x;
}
int binarySearch(int arr[], int l, int r, int x)
{
    if (r >= l)
    {
        int mid = l + (r - l) / 2;

        if (arr[mid] == x)
            return mid;

        if (arr[mid] > x)
            return binarySearch(arr, l, mid - 1, x);

        return binarySearch(arr, mid + 1, r, x);
    }
    return -1;
}
long long ncr(long long n, long long r)
{
    if (n < r)
    {
        return 0;
    }
    if (n == r || r == 0)
    {
        return 1;
    }
    ll ans = 1;
    for (ll i = n; i > n - r; i--)
        ans *= i;
    for (ll i = 1; i <= r; i++)
        ans /= i;
    return ans;
}
int main()
{
    fast;
    
        ll n = 0,s,d, m = 0, i = 0, j = 0, k = 0, l = 0;
        cin >> n>>s>>d;
        ll x[n],y[n];
        bool f=0;
        for(i=0;i<n;i++)
        {
            cin>>x[i]>>y[i];
            if(s>x[i]&&y[i]>d) 
             f=1;
        }
        if(f)
         cout<<"Yes";
        else
        {
            cout<<"No";
        }
        
        



        
    

    return 0;
}

#include <cstdio>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <cstring>
#include <queue>
#include <map>
#define LL long long
#define LD long double
#define MAXN 100005
#define MAXM
#define P
#define INF 0x3f3f3f3f
using namespace std;

int t, n, a[MAXN];

int main()
{
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d", &n);
        for(int i=1; i<=n; ++i) scanf("%d", &a[i]);
        if(n%2) printf("Second\n");
        else
        {
            int tag=0;
            sort(a+1, a+n+1);
            for(int i=1, cnt=0; i<=n; ++i)
            {
                if(a[i]!=a[i-1] && cnt%2) tag=1;
                cnt++;
            }
            if(tag) printf("First\n");
            else printf("Second\n");
        }
    }   
    return 0;
}