#include <iostream>
using namespace std;

const int NAZO = 34;

bool b[2005];
int g[2005];

int grundy(int d)
{
    if(d >= 1000)
    {
        return grundy((d - 500) % NAZO + 500);
    }
    if (b[d])
    {
        return g[d];
    }
    b[d] = true;
    bool x[2005]{0};
    for (int i = 2; i < d - 1; i++)
    {
        x[grundy(i) ^ grundy(d - i)] = true;
    }
    for (int i = 0; i <= d; i++)
    {
        if (!x[i])
        {
            return g[d] = i;
        }
    }
    return -1;
}

void solve()
{
    int t;
    cin >> t;
    while(t--)
    {
        int a, b;
        cin >> a >> b;
        if(grundy(a) ^ grundy(b))
        {
            cout << "First" << endl;
        }
        else
        {
            cout << "Second" << endl;
        }
    }
}

int main()
{
    solve();
}