#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <complex>
#include <list>
#include <cassert>
#include <chrono>
#include <random>
#include <stack>
#include <iomanip>
#include <fstream>
#include "cluedo.h"
#include "grader.h"
using namespace std;
#define endl "\n"
// #define int long long
const int INF = 1e9+7;
const int MOD = 1e9+7;
void Solve(){
vector<int> a = {1, 1, 1};
while(true){
int ans = Theory(a[0], a[1], a[2]);
if(ans == 0) break;
a[ans-1]++;
}
}
