#include "cluedo.h"
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using max_heap = priority_queue<T, vector<T>, less<T>>;
using int64 = long long;
using ld = long double;
constexpr int kInf = 1e9 + 10;
constexpr int64 kInf64 = 1e15 + 10;
constexpr int kMod = 1e9 + 7;
void Solve() {
int m = 1;
int l = 1;
int w = 1;
for (int i = Theory(m, l, w); i != 0; ) {
m += (i == 1);
l += (i == 2);
w += (i == 3);
}
}
