#include<bits/stdc++.h>
#include "workshop.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

#define bbit(i) (1<<(i))
#define bdig(x,i) (((x)>>(i))&1)

int calc(int x,int y)
{
	int i = 0;
	while(bdig(x, i) == bdig(y, i)) ++i;
	return 2 * i + bdig(x, i);
}

const int all = 6 * 6;
const int ALL = all + 5;

const int B = 4;

vector<int> g[ALL];
int c[ALL];

bool valid = 0;

void dfs(int u)
{
	if(valid) return;
	if(u >= all){ valid = 1; return;}
	if(c[u] == -1)
	{
		dfs(u+1);
		return;
	}
	
	for(int i=0; i<B; ++i)
	{
		c[u] = i;
		bool flag = 1;
		for(int v: g[u]) if(c[v] == c[u])
		{
			flag = 0;
			break;
		}
		if(flag)
		{
			dfs(u+1);
			if(valid) return;
		}
	}
}

void init(void)
{
	for(int u=0; u<all; ++u)
	{
		int x = u / 6, y = u % 6;
		
		if(x == y)
		{
			c[u] = -1;
			continue;
		}
		
		for(int z=0; z<6; ++z) if(z != y)
		{
			int v = y * 6 + z;
			if(u > v) g[u].emplace_back(v);
			else g[v].emplace_back(u);
		}
	}
	
	dfs(0);
}

int morning(int x, int r)
{
	return calc(x, r);
}

int afternoon(int l, int x, int r)
{
	return calc(calc(l,x), calc(x,r));
}

int evening(int l, int x, int r)
{
	return c[l * 6 + x];
}