#include "cluedo.h"
#include "grader.h"
#include <bits/stdc++.h>
#define _CRT_SECURE_NO_DEPRECATE
#define LSOne(S) ((S) & -(S))
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
const int INF = 1e9;
const long long LLINF = 4e18;
const double EPS = 1e-9;
/************************* Collection *****************************************/
// memset(memo, -1, sizeof memo);
// initialize DP memoization table with -1
// memset(arr, 0, sizeof arr); to clear array of integers
// set<T> s(a.begin(), a.end());
// a.resize(n, val);
// unique(a.begin(), a.end()) return new end pointer
/*************************** Sort *********************************************/
// binary_search(a.begin(), a.end(), value); // bool value return
/*************************** Misc *********************************************/
// index = (index + n - 1) % n; // index--; if (index < 0) index = n - 1;
// int ans = (int)((double)d + 0.5); // for rounding to nearest integer or
// round()
/************************************** Format ********************************/
// Format String "%a.*lf" - set precision
// Format String "%a.blf" - b digit after ., a field precision
// Format String "%[0-9]", "%[a-zA-Z]"
// Format String "%3000[^\n]" input string upto 3000 and endline
// Space before %c consume whitespace
// %% print %
// sscanf, fgets, memmove, snprintf, strsep, isalpha, isnumber, isalnum,
// string(begin(), end()), string(num, char), string.append(),
// string.push_back(), string.find(), string.find_first_of(), find_last_of(),
// find_first_not_of(), find_last_not_of(), distance(), find()
/************************************** Permutation ***************************/
// next_permutation(s.begin(), s.end());
// prev_permutation(s.begin(), s.end());
void Solve() {
int a = 1, b = 1, c = 1;
while (int t = Theory(a, b, c) != 0) {
if (t == 1) {
a++;
} else if (t == 2) {
b++;
} else {
c++;
}
}
return;
}
