/*
 * @Author:             cmk666
 * @Created time:       2023-07-31 15:46:58
 * @Last Modified time: 2023-07-31 19:51:37
 */
#include <vector>
#include <cassert>

constexpr int n[3] = {100000, 20, 6};
constexpr int m[3] = {10, 3, 2};

std::vector<int> a[3];

void init() {
	for (int i = 0; i < 3; i++) {
		for (int j = 0; (int)a[i].size() < n[i] && j < (1 << (m[i] * 2)); j++) {
			if (__builtin_popcount(j) == m[i]) {
				a[i].push_back(j);
			}
		}
		assert((int)a[i].size() == n[i]);
	}
}

int f(int i, int x, int y) {
	assert(0 <= x && x < n[i] && 0 <= y && y < n[i]);
	x = a[i][x], y = a[i][y];
	for (int j = 0; j < m[i] * 2; i++) {
		if (((x >> j) & 1) == 0 && ((y >> j) & 1) == 1) {
			return j;
		}
	}
	assert(false);
	return -1;
}

int morning(int m, int r) {
	return f(0, m, r);
}

int afternoon(int l, int m, int r) {
	return f(2, f(1, l, m), f(1, m, r));
}

int evening(int l, int m, int r) {
	if (m < 3) {
		return m;
	}
	for (int i = 0; i < 3; i++) {
		if (i != l && i != r) {
			return i;
		}
	}
	assert(false);
	return -1;
}