#include <bits/stdc++.h>
#include "island.h"
using namespace std;
#define endl '\n'
#define all(v) v.begin(), v.end()
#define get query
#define ans answer
void solve(int n,int h)
{
	set<int> se;
	for (int i=1;i<=3;i++)
		se.insert(get(1,i));
	for (int i:se)
	{
		ans(1,i);
		int v=get(i,2);
		if (se.count(v)) continue;
		ans(i,v);
		int p=i, p1=1;
		while (1)
		{
			int x=get(v,1);
			if (x==p)
			{
				x=get(v,2);
				if (x==p1) break;
			}
			ans(v,x), p1=p, p=v, v=x;
		}
	}
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |