Peli

#include <iostream>
#include <bits/stdc++.h>
#include <algorithm>
#include <vector>

using namespace std;

long long t;

string solve(pair<long long, long long> pari)
{
    if (pari.first == pari.second) return "first";

    if (pari.first == 1 && pari.second == 2) return "second";

    if (pari.first == pari.second + 1 || pari.first + 1 == pari.second) return "first";



    return "second";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);


    cin >> t;

    vector<pair<long long, long long>> tests(t);

    for (int i = 0; i < t; i++)
    {
        cin >> tests[i].first >> tests[i].second;

        cout << solve(tests[i]) << "\n";
    }
    

    return 0;
}

Test 1 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 2, 3

Verdict: WRONG ANSWER

Test 4

Group: 3

Verdict: WRONG ANSWER

Test 5

Group: 2, 3

Verdict: WRONG ANSWER

Test 6

Group: 3

Verdict: WRONG ANSWER