#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<utility>
#include<vector>
#include<stack>
#include<queue>
#include<cstring>
#include<set>
#include<map>
#include "grader.h"
#include "cluedo.h"
#define endl "\n"
#define all(v) v.begin(),v.end()
#define st first
#define nd second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long lo;
const int mod=1000000007,N=500005;
lo a,b,c,d,e,f,g=1,h[N],arr[N];
string s;
vector<lo>v;
void Solve(){
lo x=1,y=1,z=1;
while(true){
lo ok=Theory(x,y,z);
if(ok==1)x++;
if(ok==2)y++;
if(ok==3)z++;
if(ok==0)break;
}
}
