#include "workshop.h"
#include <iostream>
#include <iomanip>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <climits>
#include <functional>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <complex>
#include <random>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define itn int
#define nit int
#define ll long long
#define ms multiset
#define F(i,a,b) for(register int i=a,i##end=b;i<=i##end;++i)
#define UF(i,a,b) for(register int i=a,i##end=b;i>=i##end;--i)
#define re register
#define ri re int
#define il inline
#define pii pair<int,int>
#define cp complex<double>
#define vi vector<int>
#define ull unsigned long long
#define mem0(x) memset(x,0,sizeof(x))
#define mem0x3f(x) memset(x,0x3f,sizeof(x))
using namespace std;
int p[100002];
int M=6;
mt19937 rd(342342);
void init() {
	F(i,0,100000-1)p[i]=i;
	shuffle(p,p+100000,rd);
}

int morning(int x,int y){
	x=p[x],y=p[y];
	if(x%M!=y%M)return x;
	mt19937 rnd(x);
	int res=rnd()%400000000;
	while(res%M==y%M)res=rnd()%400000000;
	return res;
}
int mn(int x,int y){
	if(x%M!=y%M)return x;
	mt19937 rnd(x);
	int res=rnd()%400000000;
	while(res%M==y%M)res=rnd()%400000000;
	return res;
}
int afternoon(int x, int y, int z){
	if(y%M==z%M){
		mt19937 rnd(y);
		int res=rnd()%400000000;
		while(res%M==z%M||res%M==mn(x,y)%M)res=rnd()%400000000;
		return res;
	}
	return y+M*10000;
}

int evening(int x, int y, int z){
	if(y%M==z%M){
		mt19937 rnd(y);
		int res=rnd()%400000000;
		while(res%M==z%M||res%M==mn(x,y)%M)res=rnd()%400000000;
		return res%M;
	}
	return y%M;
}