for _ in range(int(input())):
a,b,c=map(int,input().split())
x=abs(a-1)
y=abs(b-c)+abs(c-1)
if(x==y):
print('3')
elif(x<y):
print('1')
else:
print('2')
#include <bits/stdc++.h>
#define Fast cin.tie(0), cout.tie(0), cin.sync_with_stdio(0), cout.sync_with_stdio(0);
#define ll long long
const ll mod = 1e9 + 7;
#define e cout<<'\n';
using namespace std;
int main() {
Fast
ll t;
cin >> t;
while (t--) {
ll a, b, c;
cin >> a >> b >> c;
if (c > b) {
if (a - 1 < abs(c - b) + c - 1) {
cout << 1;
e
} else if (a - 1 > abs(c - b) + c - 1) {
cout << 2;
e
} else {
cout << 3;
e
}
} else {
if (a < b) {
cout << 1;
e
} else if (b < a) {
cout << 2;
e
} else {
cout << 3;
e
}
}
}
}
One String No Trouble | Help Jarvis! |
Lift queries | Goki and his breakup |
Ali and Helping innocent people | Book of Potion making |
Duration | Birthday Party |
e-maze-in | Bricks Game |
Char Sum | Two Strings |
Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |