PROGRAMMING:Report figures
Y * * n won't play blackjack or Soha this time. He wants to play a traditional game with you - report numbers
The rules of the game are as follows:
1. The two persons shall report the number in turn, and the number shall be in order, and the number can only be no more than m at a time
2. Who will report to the nth number first will win
3. Start from 1
Y * * n is very smart and always takes the best strategy. Of course, you want to win him. Because whoever loses will be invited to drink milk tea. Fortunately, in order to take care of you, he gave you the opportunity to decide whether to be the first or the second.
There are t rounds in the contest. Given n and m in each round, how do you choose to be the first or the second to ensure that you can win as high as possible against y * * n?
###Input format:
Input the number of rounds t in the first line (1 ≤ t ≤ 100)
In the second line, enter the total number n to be reported and the maximum number m that can be reported at one time (1 ≤ n, m ≤ 1000000)
###Output format:
For each round, the first hand outputs "first" and the second hand outputs "second" (excluding double quotation marks)
###Input example:
Here is a set of inputs. For example:
```in
two
23 2
4 3
```
###Output example:
The corresponding output is given here. For example:
```out
first
second
```
answer：If there is no answer, please comment
The rules of the game are as follows:
1. The two persons shall report the number in turn, and the number shall be in order, and the number can only be no more than m at a time
2. Who will report to the nth number first will win
3. Start from 1
Y * * n is very smart and always takes the best strategy. Of course, you want to win him. Because whoever loses will be invited to drink milk tea. Fortunately, in order to take care of you, he gave you the opportunity to decide whether to be the first or the second.
There are t rounds in the contest. Given n and m in each round, how do you choose to be the first or the second to ensure that you can win as high as possible against y * * n?
###Input format:
Input the number of rounds t in the first line (1 ≤ t ≤ 100)
In the second line, enter the total number n to be reported and the maximum number m that can be reported at one time (1 ≤ n, m ≤ 1000000)
###Output format:
For each round, the first hand outputs "first" and the second hand outputs "second" (excluding double quotation marks)
###Input example:
Here is a set of inputs. For example:
```in
two
23 2
4 3
```
###Output example:
The corresponding output is given here. For example:
```out
first
second
```
answer：If there is no answer, please comment