#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include "cluedo.h"
#include "grader.h"
using namespace std;
#define ll long long
#define f first
#define s second
int m, l, w, t;
void Solve() {
m = 1, l = 1, w = 1;
t = Theory(m, l, w);
while (t) {
if (t == 1) m++;
else if (t == 2) l++;
else w++;
t = Theory(m, l, w);
}
return;
}
