#pragma GCC optimize("-O3")
#include<bits/stdc++.h>
#include "grader.h"
#include "cluedo.h"
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define p_b pop_back
#define f first
#define s second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
void Solve(){
int i = 1, j = 1, k = 1;
while(true)
{
int ask = Theory(i, j, k);
if(ask == 0)
return;
if(ask == 1)
i++;
if(ask == 2)
j++;
if(ask == 3)
k++;
}
}
