Coin Game Winner Problem Statement

Two players 'X' and 'Y' are participating in a coin game. Starting with 'N' coins, players alternate turns, with 'X' starting first. On each turn, a player has three choices: pick exactly 'A' coins, 'B' coins, or 1 coin. The player unable to make a move loses. Determine the winner if both players play optimally.

Input:

The first line contains an integer ‘T’ representing the number of test cases.
Each test case consists of three integers: ‘N’ (the number of coins), ‘A’, and ‘B’ (the number of coins that can be picked on a turn).

Output:

Return 1 if X wins the game, and return 0 if Y wins for each test case.

Example:

Input:
2
3 2 1
4 3 2

Output:
1
0

Constraints:

• 1 <= T <= 10
• 1 <= N <= 105

Note: Implement only the function to determine the winner; no need to handle input/output operations.