#include "mpc.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
int precalc(int n, int m){
	/*int x=n+m, p=1;
	while(p<n) {
		p*=2;
		++x;
	}
	return x+1;*/
	return n+m+3;
}
void dodaj(player &player, int x, int car) {
	if(!car) return;
	for(int i=x; i<2200; ++i) {
		if(!car) return;
		if(car) {
			player.memory[i]^=1;
			if(player.memory[i]) car=0;
		}
	}
}
bool transmit(player &player, int round, int position){
	vector<int>N={0, 5, 1000, 1000, 1000, 3, 10, 500, 1000, 1500, 2000};
	vector<int>M={0, 5, 1, 10, 30, 1000, 1000, 1000, 1000, 1500, 2000};
	int subtask = 4; // do zmiany
	int n=N[subtask];
	int m=M[subtask];
	int K=6;
	if(round>position) {
		dodaj(player, round-position-1, player.last_message);
		bool p=player.memory[round-position-1];
		if(position!=n) player.memory[round-position-1]=false;
		return p;
	}
	if(position-1>=K && m-1-(position-K-1)+(round-2)>=0) {
		dodaj(player, m-1-(position-K-1)+(round-2), player.last_message);
	}
	if(position>=K && m-1-(position-K)+(round-1)>=0) {
		bool p=player.memory[m-1-(position-K)+(round-1)];
		if(position!=n) player.memory[m-1-(position-K)+(round-1)]=false;
		return p;
	}
	return false;
}