#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <limits.h>
#include "grader.h"
#include "cluedo.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef map<int, int> mii;
typedef vector<vl> vvl;
typedef pair<ll, ll> pll;
typedef vector<pll> vpl;
#define F first
#define S second
#define yes cout << 'YES' << endl
#define no cout << 'NO' << endl
#define pb push_back
#define forn(i, x, n) for (ll i = x; i <= n; i++)
#define srt(x) sort(x.begin(), x.end())
#define mod 1000000007
#define inf 10000000000
void Solve(){
int i = 1, j = 1, k = 1;
while(true){
int r = Theory(i, j, k);
if(r == 0) break;
else if(r == 1) i++;
else if(r == 2) j++;
else k++;
}
/*forn(i, 1, 6){
forn(j, 1, 10){
forn(k, 1, 6){
if(Theory(i, j, k) == 0) return;
}
}
}*/
}
