#include "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
#define rando mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define sz(x) (int)(x.size())
using namespace std;
vector<int> vec[3];
rando;
void Solve(){
vec[0].clear(),vec[1].clear(),vec[2].clear();
for (int i = 1; i <= 6; ++i)
vec[0].push_back(i);
for (int i = 1; i <= 10; ++i)
vec[1].push_back(i);
for (int i = 1; i <= 6; ++i)
vec[2].push_back(i);
for (int i = 0; i < 3; ++i)
shuffle(vec[i].begin(),vec[i].end(),rng);
while(sz(vec[0])!=1 || sz(vec[1])!=1 || sz(vec[2])!=1){
int h=Theory(vec[0].back(),vec[1].back(),vec[2].back());
if(!h)return;
vec[h-1].pop_back();
}
Theory(vec[0].back(),vec[1].back(),vec[2].back());
}
