For this Question: Harry wants to rescue Fleur's sister Gabrielle in the underwater task. For that he needs to get ahead of all the people in the two magical queues. 
Our small Tono and Solo are busy casting spells alternatively to remove people from the two magical queues. But since they are highly competitive, both of them wish to be the last person to remove people from the queue.

We can consider the removal of people as game played between Tono and Solo with the following rules:
<li> The turn goes alternatively. Tono starts the game.
<li> In each turn, the player first chooses a queue, then removes 3*X people from the queue, and then adds X people to the other queue (X > 0).
<li> The player who is unable to make a move loses.
<li> Both the players play with the most optimal strategy.

Since this game can take a lot of time to complete, Harry can declare the last person to remove people from the queue directly. Can you please help Harry accomplish the task, and save Gabrielle by being on time?The first line of the input contains an integer T denoting the number of test cases.
The next T lines contains two integers L1 and L2, denoting the initial number of people standing in the two queues.

Constraints
1 <= T <= 100
1 <= L1, L2 <= 200000For each test case, output "Tono" (without quotes) if Tono wins the game, else output "Solo" (without quotes) in a new line.Sample Input
2
0 1
0 2

Sample Output
Solo
Solo

Explanation
For both test cases, since Tono cannot make any move in the first turn itself, she loses.

Sample Input
1
1 4

Sample Output
Tono

Explanation
Tono removes 3 people from second queue, and adds 1 in the first queue. The queues now have 2 and 1 people respectively. Since Solo cannot make a move now, she loses., I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define sz(v) (int) v.size()
#define pr(v) For(i, 0, sz(v)) {cout<<v[i]<<" ";} cout<<endl;
#define slld(x) scanf("%lld", &x)
#define all(x) x.begin(), x.end()
#define For(i, st, en) for(int i=st; i<en; i++)
#define tr(x) for(auto it=x.begin(); it!=x.end(); it++)
#define fast std::ios::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define ll long long
#define ld long double
#define int long long
#define double long double
#define mp make_pair
#define F first
#define S second
typedef pair<int, int> pii;
typedef vector<int> vi;
#define pi 3.141592653589793238
const int MOD = 1e9+7;
const int INF = 1LL<<60;


const int N = 2e5+5;

// it's swapnil07 ;)
 
#ifdef SWAPNIL07
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
#else
#define endl '\n'
#define trace(...)
#define end_routine()
#endif


void solve(){
    int l1, l2; cin>>l1>>l2;
    assert(l1<=200000 && l2<=200000);
    if(abs(l1-l2)<2){
        cout<<"Solo";
        return;
    }
    else if(abs(l1-l2)>=3){
        cout<<"Tono";
        return;
    }
    if(l1%2){
        cout<<"Tono";
    }
    else{
        cout<<"Solo";
    }
}


signed main()
{
    fast
    #ifdef SWAPNIL07
        freopen("input.txt","r",stdin);
        freopen("output.txt","w",stdout);
    #endif
    int t=1; 
    cin>>t;
    while(t--){
        solve();
        cout<<"\n";
    }
    return 0;
}

, In this Programming Language: C++, Now tell me if this Code is compilable or not?