#include <cstdio>
#include <vector>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <cstring>

using namespace std;


/*
Komentarz dla Jury Potyczek Algorytmicznych: uzywam gotowej biblioteki do obslugi duzych intow. Zrodlo:
https://gist.github.com/ar-pa/957297fb3f88996ead11
*/

/*
================================================ vvvvv BIBLIOTEKA vvvvv ================================================
*/

/*
  ######################################################################
  #######################   THE   BIG   INT   ##########################
*/
const int base = 1000000000;
const int base_digits = 9; 
struct bigint {
	vector<int> a;
	int sign;
	/*<arpa>*/
	int size(){
		if(a.empty())return 0;
		int ans=(a.size()-1)*base_digits;
		int ca=a.back();
		while(ca)
			ans++,ca/=10;
		return ans;
	}
	bigint operator ^(const bigint &v){
		bigint ans=1,a=*this,b=v;
		while(!b.isZero()){
			if(b%2)
				ans*=a;
			a*=a,b/=2;
		}
		return ans;
	}
	bigint modPow(bigint base, bigint exp, const bigint &mod) {
		bigint result = 1;
		base %= mod;
		while (!exp.isZero()) {
			if (exp % 2)
				result = (result * base) % mod;
			base = (base * base) % mod;
			exp /= 2;
		}
		return result;
	}
	string to_string(){
		stringstream ss;
		ss << *this;
		string s;
		ss >> s;
		return s;
	}
	int sumof(){
		string s = to_string();
		int ans = 0;
		for(auto c : s)  ans += c - '0';
		return ans;
	}
	/*</arpa>*/
	bigint() :
		sign(1) {
	}
 
	bigint(long long v) {
		*this = v;
	}
 
	bigint(const string &s) {
		read(s);
	}
 
	void operator=(const bigint &v) {
		sign = v.sign;
		a = v.a;
	}
 
	void operator=(long long v) {
		sign = 1;
		a.clear();
		if (v < 0)
			sign = -1, v = -v;
		for (; v > 0; v = v / base)
			a.push_back(v % base);
	}
 
	bigint operator+(const bigint &v) const {
		if (sign == v.sign) {
			bigint res = v;
 
			for (int i = 0, carry = 0; i < (int) max(a.size(), v.a.size()) || carry; ++i) {
				if (i == (int) res.a.size())
					res.a.push_back(0);
				res.a[i] += carry + (i < (int) a.size() ? a[i] : 0);
				carry = res.a[i] >= base;
				if (carry)
					res.a[i] -= base;
			}
			return res;
		}
		return *this - (-v);
	}
 
	bigint operator-(const bigint &v) const {
		if (sign == v.sign) {
			if (abs() >= v.abs()) {
				bigint res = *this;
				for (int i = 0, carry = 0; i < (int) v.a.size() || carry; ++i) {
					res.a[i] -= carry + (i < (int) v.a.size() ? v.a[i] : 0);
					carry = res.a[i] < 0;
					if (carry)
						res.a[i] += base;
				}
				res.trim();
				return res;
			}
			return -(v - *this);
		}
		return *this + (-v);
	}
 
	void operator*=(int v) {
		if (v < 0)
			sign = -sign, v = -v;
		for (int i = 0, carry = 0; i < (int) a.size() || carry; ++i) {
			if (i == (int) a.size())
				a.push_back(0);
			long long cur = a[i] * (long long) v + carry;
			carry = (int) (cur / base);
			a[i] = (int) (cur % base);
			//asm("divl %%ecx" : "=a"(carry), "=d"(a[i]) : "A"(cur), "c"(base));
		}
		trim();
	}
 
	bigint operator*(int v) const {
		bigint res = *this;
		res *= v;
		return res;
	}
 
	void operator*=(long long v) {
		if (v < 0)
			sign = -sign, v = -v;
		if(v > base){
			*this = *this * (v / base) * base + *this * (v % base);
			return ;
		}
		for (int i = 0, carry = 0; i < (int) a.size() || carry; ++i) {
			if (i == (int) a.size())
				a.push_back(0);
			long long cur = a[i] * (long long) v + carry;
			carry = (int) (cur / base);
			a[i] = (int) (cur % base);
			//asm("divl %%ecx" : "=a"(carry), "=d"(a[i]) : "A"(cur), "c"(base));
		}
		trim();
	}
 
	bigint operator*(long long v) const {
		bigint res = *this;
		res *= v;
		return res;
	}
 
	friend pair<bigint, bigint> divmod(const bigint &a1, const bigint &b1) {
		int norm = base / (b1.a.back() + 1);
		bigint a = a1.abs() * norm;
		bigint b = b1.abs() * norm;
		bigint q, r;
		q.a.resize(a.a.size());
 
		for (int i = a.a.size() - 1; i >= 0; i--) {
			r *= base;
			r += a.a[i];
			int s1 = r.a.size() <= b.a.size() ? 0 : r.a[b.a.size()];
			int s2 = r.a.size() <= b.a.size() - 1 ? 0 : r.a[b.a.size() - 1];
			int d = ((long long) base * s1 + s2) / b.a.back();
			r -= b * d;
			while (r < 0)
				r += b, --d;
			q.a[i] = d;
		}
 
		q.sign = a1.sign * b1.sign;
		r.sign = a1.sign;
		q.trim();
		r.trim();
		return make_pair(q, r / norm);
	}
 
	bigint operator/(const bigint &v) const {
		return divmod(*this, v).first;
	}
 
	bigint operator%(const bigint &v) const {
		return divmod(*this, v).second;
	}
 
	void operator/=(int v) {
		if (v < 0)
			sign = -sign, v = -v;
		for (int i = (int) a.size() - 1, rem = 0; i >= 0; --i) {
			long long cur = a[i] + rem * (long long) base;
			a[i] = (int) (cur / v);
			rem = (int) (cur % v);
		}
		trim();
	}
 
	bigint operator/(int v) const {
		bigint res = *this;
		res /= v;
		return res;
	}
 
	int operator%(int v) const {
		if (v < 0)
			v = -v;
		int m = 0;
		for (int i = a.size() - 1; i >= 0; --i)
			m = (a[i] + m * (long long) base) % v;
		return m * sign;
	}
 
	void operator+=(const bigint &v) {
		*this = *this + v;
	}
	void operator-=(const bigint &v) {
		*this = *this - v;
	}
	void operator*=(const bigint &v) {
		*this = *this * v;
	}
	void operator/=(const bigint &v) {
		*this = *this / v;
	}
	void operator%=(const bigint &v){
		*this = *this % v;
	} 
	bool operator<(const bigint &v) const {
		if (sign != v.sign)
			return sign < v.sign;
		if (a.size() != v.a.size())
			return a.size() * sign < v.a.size() * v.sign;
		for (int i = a.size() - 1; i >= 0; i--)
			if (a[i] != v.a[i])
				return a[i] * sign < v.a[i] * sign;
		return false;
	}
 
	bool operator>(const bigint &v) const {
		return v < *this;
	}
	bool operator<=(const bigint &v) const {
		return !(v < *this);
	}
	bool operator>=(const bigint &v) const {
		return !(*this < v);
	}
	bool operator==(const bigint &v) const {
		return !(*this < v) && !(v < *this);
	}
	bool operator!=(const bigint &v) const {
		return *this < v || v < *this;
	}
 
	void trim() {
		while (!a.empty() && !a.back())
			a.pop_back();
		if (a.empty())
			sign = 1;
	}
 
	bool isZero() const {
		return a.empty() || (a.size() == 1 && !a[0]);
	}
 
	bigint operator-() const {
		bigint res = *this;
		res.sign = -sign;
		return res;
	}
 
	bigint abs() const {
		bigint res = *this;
		res.sign *= res.sign;
		return res;
	}
 
	long long longValue() const {
		long long res = 0;
		for (int i = a.size() - 1; i >= 0; i--)
			res = res * base + a[i];
		return res * sign;
	}
 
	friend bigint gcd(const bigint &a, const bigint &b) {
		return b.isZero() ? a : gcd(b, a % b);
	}
	friend bigint lcm(const bigint &a, const bigint &b) {
		return a / gcd(a, b) * b;
	}
 
	void read(const string &s) {
		sign = 1;
		a.clear();
		int pos = 0;
		while (pos < (int) s.size() && (s[pos] == '-' || s[pos] == '+')) {
			if (s[pos] == '-')
				sign = -sign;
			++pos;
		}
		for (int i = s.size() - 1; i >= pos; i -= base_digits) {
			int x = 0;
			for (int j = max(pos, i - base_digits + 1); j <= i; j++)
				x = x * 10 + s[j] - '0';
			a.push_back(x);
		}
		trim();
	}
 
	friend istream& operator>>(istream &stream, bigint &v) {
		string s;
		stream >> s;
		v.read(s);
		return stream;
	}
 
	friend ostream& operator<<(ostream &stream, const bigint &v) {
		if (v.sign == -1)
			stream << '-';
		stream << (v.a.empty() ? 0 : v.a.back());
		for (int i = (int) v.a.size() - 2; i >= 0; --i)
			stream << setw(base_digits) << setfill('0') << v.a[i];
		return stream;
	}
 
	static vector<int> convert_base(const vector<int> &a, int old_digits, int new_digits) {
		vector<long long> p(max(old_digits, new_digits) + 1);
		p[0] = 1;
		for (int i = 1; i < (int) p.size(); i++)
			p[i] = p[i - 1] * 10;
		vector<int> res;
		long long cur = 0;
		int cur_digits = 0;
		for (int i = 0; i < (int) a.size(); i++) {
			cur += a[i] * p[cur_digits];
			cur_digits += old_digits;
			while (cur_digits >= new_digits) {
				res.push_back(int(cur % p[new_digits]));
				cur /= p[new_digits];
				cur_digits -= new_digits;
			}
		}
		res.push_back((int) cur);
		while (!res.empty() && !res.back())
			res.pop_back();
		return res;
	}
 
	typedef vector<long long> vll;
 
	static vll karatsubaMultiply(const vll &a, const vll &b) {
		int n = a.size();
		vll res(n + n);
		if (n <= 32) {
			for (int i = 0; i < n; i++)
				for (int j = 0; j < n; j++)
					res[i + j] += a[i] * b[j];
			return res;
		}
 
		int k = n >> 1;
		vll a1(a.begin(), a.begin() + k);
		vll a2(a.begin() + k, a.end());
		vll b1(b.begin(), b.begin() + k);
		vll b2(b.begin() + k, b.end());
 
		vll a1b1 = karatsubaMultiply(a1, b1);
		vll a2b2 = karatsubaMultiply(a2, b2);
 
		for (int i = 0; i < k; i++)
			a2[i] += a1[i];
		for (int i = 0; i < k; i++)
			b2[i] += b1[i];
 
		vll r = karatsubaMultiply(a2, b2);
		for (int i = 0; i < (int) a1b1.size(); i++)
			r[i] -= a1b1[i];
		for (int i = 0; i < (int) a2b2.size(); i++)
			r[i] -= a2b2[i];
 
		for (int i = 0; i < (int) r.size(); i++)
			res[i + k] += r[i];
		for (int i = 0; i < (int) a1b1.size(); i++)
			res[i] += a1b1[i];
		for (int i = 0; i < (int) a2b2.size(); i++)
			res[i + n] += a2b2[i];
		return res;
	}
 
	bigint operator*(const bigint &v) const {
		vector<int> a6 = convert_base(this->a, base_digits, 6);
		vector<int> b6 = convert_base(v.a, base_digits, 6);
		vll a(a6.begin(), a6.end());
		vll b(b6.begin(), b6.end());
		while (a.size() < b.size())
			a.push_back(0);
		while (b.size() < a.size())
			b.push_back(0);
		while (a.size() & (a.size() - 1))
			a.push_back(0), b.push_back(0);
		vll c = karatsubaMultiply(a, b);
		bigint res;
		res.sign = sign * v.sign;
		for (int i = 0, carry = 0; i < (int) c.size(); i++) {
			long long cur = c[i] + carry;
			res.a.push_back((int) (cur % 1000000));
			carry = (int) (cur / 1000000);
		}
		res.a = convert_base(res.a, 6, base_digits);
		res.trim();
		return res;
	}
};
/*
  #######################   THE   BIG   INT   ##########################
  ######################################################################
*/


/*
================================================ ^^^^^ BIBLIOTEKA ^^^^^ ================================================
*/

const unsigned int SECRET_SEED = 3188213416;

const bool ALGOSIA = false;
const bool BAJTEK = true;

const int PHASE_TIE = 0;
const int PHASE_LOSING = -1;
const int PHASE_WINNING = 1;

const char ROCK = 'K';
const char PAPER = 'P';
const char SCISSORS = 'N';

const bigint BIG_INT_0 = bigint(0);
const bigint BIG_INT_1 = bigint(1);

const int BIGGER_PART_NUMERATOR = 3;
const int BIGGER_PART_DENOMINATOR = 4;

int n;
int t;
char name_to_read[10];
char binary_chain[5100];
char magic_xor_chain[5100];
bool my_name;
bigint my_number;
bigint my_range_left;
bigint my_range_right;
bigint their_range_left;
bigint their_range_right;
int current_phase;
bool my_number_fully_sent;
bool their_number_fully_sent;

void xor_binary_chain() {
  for (int i = 0; i < n; i++) {
    binary_chain[i] = ((binary_chain[i] - '0') xor (magic_xor_chain[i] - '0')) + '0';
  }
}

void binary_chain_to_my_number() {
  my_number = BIG_INT_0;
  for (int i = 0; i < n; i++) {
    my_number *= 2;
    if (binary_chain[i] == '1') {
      my_number += BIG_INT_1;
    }
  }
}

void their_number_to_binary_chain() {
  for (int i = n - 1; i >= 0; i--) {
    if (their_range_left % 2 == 1) {
      binary_chain[i] = '1';
    } else {
      binary_chain[i] = '0';
    }
    their_range_left /= 2;
  }
}

void determine_if_numbers_fully_sent() {
  if (!my_number_fully_sent) {
    bigint diff = my_range_right;
    diff -= my_range_left;
    if (diff == BIG_INT_1) {
      my_number_fully_sent = true;
    }
  }

  if (!their_number_fully_sent) {
    bigint diff = their_range_right;
    diff -= their_range_left;
    if (diff == BIG_INT_1) {
      their_number_fully_sent = true;
    }
  }
}

void determine_phase(char my_message, char their_message) {
  if (my_message != their_message) { // if tie, current phase remains unchanged
    if (((my_message == ROCK) && (their_message == SCISSORS))
      || ((my_message == PAPER) && (their_message == ROCK))
      || ((my_message == SCISSORS) && (their_message == PAPER))) { // I won, advancing in phase...
        if (current_phase == PHASE_LOSING) {
          current_phase = PHASE_TIE;
        } else { // otherwise it means that there was tie and now I'm winning (it should not be possible that I was winning before that move!)
          current_phase = PHASE_WINNING;
        }
    } else { // otherwise it means that I lose, declining in phase...
      if (current_phase == PHASE_WINNING) {
        current_phase = PHASE_TIE;
      } else { // otherwise it means that there was tie and now I'm losing (it should not be possible that I was losing before that move!)
        current_phase = PHASE_LOSING;
      }
    }
  }
}

int main() {
  // read and set the name
  // (coming back after implementation is done - it seems that I don't need to know who I am... and after long day of debugging and optimisations I don't know my name anyway ;) anyway, leaving as is)
  scanf("%s", name_to_read);
  if (strcmp(name_to_read, "Algosia") == 0) {
    my_name = ALGOSIA;
  } else {
    my_name = BAJTEK;
  }

  // read n & t
  scanf("%d %d", &n, &t);

  // prepare magic random number for xoring
  srand(SECRET_SEED);
  for (int i = 0; i < n; i++) {
    magic_xor_chain[i] = (rand() % 2) + '0'; // to remember: stored as string for debug purposes mainly
  }
  magic_xor_chain[n] = '\0';

  // main loop over t cases
  for (int case_number = 1; case_number <= t; case_number++) {
    // read my number
    scanf("%s", binary_chain);

    // fprintf(stderr, "MY BINARY: !%s!\n", binary_chain);
    // fprintf(stderr, "MY MAGICN: %s\n", magic_xor_chain);

    // make the chain more random (xor using magic number)
    xor_binary_chain();
    
    // fprintf(stderr, "AFTER XOR: %s\n", binary_chain);

    // convert binary chain to big int (to my number)
    binary_chain_to_my_number();

    // fprintf(stderr, "CONVERTED: %s\n", my_number.toString().c_str());

    // set initial ranges (left <= number < right)
    my_range_left = BIG_INT_0;
    my_range_right = BIG_INT_1;
    for (int i = 0; i < n; i++) {
      my_range_right *= 2;
    }
    their_range_left = my_range_left;
    their_range_right = my_range_right;

    // fprintf(stderr, "THEIR RANGE RIGHT: %s\n", their_range_right.toString().c_str());

    // initialize phase and other variables
    current_phase = PHASE_TIE;
    my_number_fully_sent = false;
    their_number_fully_sent = false;

    // start the game!
    while (true) {

      char my_message;
      char their_message;

      if (current_phase == PHASE_TIE) { // I (and opponent) can pass 1 of 3 possible values (divide range into 3 equal subranges)

        // prepare my ranges and message
        if (my_number_fully_sent) { // if my number was already fully sent, we can send whatever (in case of tie) - let's say always ROCK
          my_message = ROCK;
        } else {
          // bigint my_one_third_length = (my_range_right - my_range_left + BIG_INT_1) / 3; // small optimisation vvv
          bigint my_one_third_length = my_range_right;
          my_one_third_length -= my_range_left;
          my_one_third_length += BIG_INT_1;
          my_one_third_length /= 3;
          if (my_one_third_length < BIG_INT_1) { // to not enter infinite loops near the end of the game, it needs to be at least 1!
            my_one_third_length = BIG_INT_1;
          }
          // bigint my_range_one_third = my_range_left + my_one_third_length; // small optimisation vvv
          bigint my_range_one_third = my_range_left;
          my_range_one_third += my_one_third_length;
          if (my_number < my_range_one_third) { // my number is in the first 1/3, send ROCK
            my_message = ROCK;
            my_range_right = my_range_one_third;
          } else {
            // bigint my_range_two_thirds = my_range_one_third + my_one_third_length; // small optimisation vvv
            bigint my_range_two_thirds = my_range_one_third;
            my_range_two_thirds += my_one_third_length;
            if (my_number < my_range_two_thirds) { // my number is in the second 1/3, send PAPER
              my_message = PAPER;
              my_range_left = my_range_one_third;
              my_range_right = my_range_two_thirds;
            } else { // otherwise it means that my number is in the third 1/3, send SCISSORS
              my_message = SCISSORS;
              my_range_left = my_range_two_thirds;
            }
          }
        }

        // send my message
        printf("%c\n", my_message);
        fflush(stdout);

        // read their message
        scanf(" %c", &their_message);

        // process their message
        if (!their_number_fully_sent) { // I need to process only if I don't know their number yet
          // bigint their_one_third_length = (their_range_right - their_range_left + BIG_INT_1) / 3; // small optimisation vvv
          bigint their_one_third_length = their_range_right;
          their_one_third_length -= their_range_left;
          their_one_third_length += BIG_INT_1;
          their_one_third_length /= 3;
          if (their_one_third_length < BIG_INT_1) { // to not enter infinite loops near the end of the game, it needs to be at least 1!
            their_one_third_length = BIG_INT_1;
          }
          // bigint their_range_one_third = their_range_left + their_one_third_length; // small optimisation vvv
          bigint their_range_one_third = their_range_left;
          their_range_one_third += their_one_third_length;
          if (their_message == ROCK) { // it means that their number is in the first 1/3
            their_range_right = their_range_one_third;
          } else {
            // bigint their_range_two_thirds = their_range_one_third + their_one_third_length; // small optimisation vvv
            bigint their_range_two_thirds = their_range_one_third;
            their_range_two_thirds += their_one_third_length;
            if (their_message == PAPER) { // it means that their number is in the second 1/3
              their_range_left = their_range_one_third;
              their_range_right = their_range_two_thirds;
            } else { // otherwise (SCISSORS) it means that their number is in the third 1/3
              their_range_left = their_range_two_thirds;
            }
          }
        }

      } else if (current_phase == PHASE_LOSING) { // if I'm losing, then opponent is passive (sends ROCK), and I'm active - sending them 1 of 2 possible values

        if (my_number_fully_sent) { // ... unless my number is already sent, then I'm passive (always sending ROCK), letting them to pass info

          // prepare my simple message - ROCK
          my_message = ROCK;

          // send my message
          printf("%c\n", my_message);
          fflush(stdout);

          // read their message
          scanf(" %c", &their_message);

          // process their message (I'm not checking if their number is fully sent - it should not happen...)
          // copy pasting from below (logic described below)
          // bigint their_bigger_part_length = (their_range_right - their_range_left + BIG_INT_1) * BIGGER_PART_NUMERATOR / BIGGER_PART_DENOMINATOR; // small optimisation vvv
          bigint their_bigger_part_length = their_range_right;
          their_bigger_part_length -= their_range_left;
          their_bigger_part_length += BIG_INT_1;
          their_bigger_part_length *= BIGGER_PART_NUMERATOR;
          their_bigger_part_length /= BIGGER_PART_DENOMINATOR;
          if (their_bigger_part_length < BIG_INT_1) { // to not enter infinite loops near the end of the game, it needs to be at least 1!
            their_bigger_part_length = BIG_INT_1;
          }
          // bigint their_range_mid_point = their_range_left + their_bigger_part_length; // small optimisation vvv
          bigint their_range_mid_point = their_range_left;
          their_range_mid_point += their_bigger_part_length;
          if (their_message == SCISSORS) { // I'm losing and I'm sending ROCK, so SCISSORS is sent by opponent to try to come back to tie for bigger subrange
            their_range_right = their_range_mid_point;
          } else { // otherwise they should send ROCK to tie now (hopefully...)
            their_range_left = their_range_mid_point;
          }

        } else {

          // prepare my ranges and message
          // I want to divide range disproportionately - to have bigger chance (wider range) to achieve state where I come back to the tie
          // (to be able to send 1 of 3 possible values each of us); or if I hit smaller range, at least I converge earlier;
          // proportion of range division determined empirically (75:25 seems to work OK; 75/100 = 3/4)
          // bigint my_bigger_part_length = (my_range_right - my_range_left + BIG_INT_1) * BIGGER_PART_NUMERATOR / BIGGER_PART_DENOMINATOR; // small optimisation vvv
          bigint my_bigger_part_length = my_range_right;
          my_bigger_part_length -= my_range_left;
          my_bigger_part_length += BIG_INT_1;
          my_bigger_part_length *= BIGGER_PART_NUMERATOR;
          my_bigger_part_length /= BIGGER_PART_DENOMINATOR;
          if (my_bigger_part_length < BIG_INT_1) { // to not enter infinite loops near the end of the game, it needs to be at least 1!
            my_bigger_part_length = BIG_INT_1;
          }
          // bigint my_range_mid_point = my_range_left + my_bigger_part_length; // small optimisation vvv
          bigint my_range_mid_point = my_range_left;
          my_range_mid_point += my_bigger_part_length;
          if (my_number < my_range_mid_point) { // my number is in the first bigger part, so send PAPER to win and achieve tie again
            my_message = PAPER;
            my_range_right = my_range_mid_point;
          } else { // otherwise it's in the smaller part, send ROCK to tie now
            my_message = ROCK;
            my_range_left = my_range_mid_point;
          }

          // send my message
          printf("%c\n", my_message);
          fflush(stdout);

          // read their message (and do nothing, ignore - they are passive side and should send ROCK [I hope it is ROCK...])
          scanf(" %c", &their_message);
        }

      } else { // otherwise I'm winning, so I'm passive (sending ROCK), and opponent is active - sending towards me 1 of 2 possible values

        if (their_number_fully_sent) { // ... unless their number is already sent, then they're passive (always sending ROCK), letting me to pass info

          // it's slightly modified copy paste from the above (from my_number_fully_sent == false [else] branch)...

          // prepare my ranges and message
          // bigint my_bigger_part_length = (my_range_right - my_range_left + BIG_INT_1) * BIGGER_PART_NUMERATOR / BIGGER_PART_DENOMINATOR; // small optimisation vvv
          bigint my_bigger_part_length = my_range_right;
          my_bigger_part_length -= my_range_left;
          my_bigger_part_length += BIG_INT_1;
          my_bigger_part_length *= BIGGER_PART_NUMERATOR;
          my_bigger_part_length /= BIGGER_PART_DENOMINATOR;
          if (my_bigger_part_length < BIG_INT_1) { // to not enter infinite loops near the end of the game, it needs to be at least 1!
            my_bigger_part_length = BIG_INT_1;
          }
          // bigint my_range_mid_point = my_range_left + my_bigger_part_length; // small optimisation vvv
          bigint my_range_mid_point = my_range_left;
          my_range_mid_point += my_bigger_part_length;
          if (my_number < my_range_mid_point) { // my number is in the first bigger part, so send SCISSORS to lose and achieve tie again
            my_message = SCISSORS;
            my_range_right = my_range_mid_point;
          } else { // otherwise it's in the smaller part, send ROCK to tie
            my_message = ROCK;
            my_range_left = my_range_mid_point;
          }

          // send my message
          printf("%c\n", my_message);
          fflush(stdout);

          // read their message (and do nothing, ignore - they are passive side and should send ROCK [I hope it is ROCK...])
          scanf(" %c", &their_message);

        } else {

          // it's slightly modified copy paste from the above (from my_number_fully_sent == true branch)...

          // prepare my simple message - ROCK
          my_message = ROCK;

          // send my message
          printf("%c\n", my_message);
          fflush(stdout);

          // read their message
          scanf(" %c", &their_message);

          // process their message (I'm not checking if my number is fully sent - it should not happen...)
          // bigint their_bigger_part_length = (their_range_right - their_range_left + BIG_INT_1) * BIGGER_PART_NUMERATOR / BIGGER_PART_DENOMINATOR; // small optimisation vvv
          bigint their_bigger_part_length = their_range_right;
          their_bigger_part_length -= their_range_left;
          their_bigger_part_length += BIG_INT_1;
          their_bigger_part_length *= BIGGER_PART_NUMERATOR;
          their_bigger_part_length /= BIGGER_PART_DENOMINATOR;
          if (their_bigger_part_length < BIG_INT_1) { // to not enter infinite loops near the end of the game, it needs to be at least 1!
            their_bigger_part_length = BIG_INT_1;
          }
          // bigint their_range_mid_point = their_range_left + their_bigger_part_length; // small optimisation vvv
          bigint their_range_mid_point = their_range_left;
          their_range_mid_point += their_bigger_part_length;
          if (their_message == PAPER) { // I'm winning and I'm sending ROCK, so PAPER is sent by opponent to try to come back to tie for bigger subrange
            their_range_right = their_range_mid_point;
          } else { // otherwise they should send ROCK to tie now (hopefully...)
            their_range_left = their_range_mid_point;
          }

        }

      }

      // check if my or their (or both) numbers are not fully sent (and reflect the state in proper variables)
      determine_if_numbers_fully_sent();

      // decide what's the phase after that exchange of messages
      determine_phase(my_message, their_message);

      // if we both know our numbers, it's time to send the opponents number and break the loop! (hopefully opponent does the same...)
      if (my_number_fully_sent && their_number_fully_sent) {
        // their number is equal to their_range_left - convert it to the binary chain
        their_number_to_binary_chain();

        // now reverse "making chain more random" by xoring by magic number again
        xor_binary_chain();

        // print response
        printf("! %s\n", binary_chain);
        fflush(stdout);

        // break the loop
        break;
      }
    }
  }

  return 0;
}

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841

#include <cstdio>
#include <vector>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <cstring>

using namespace std;


/*
Komentarz dla Jury Potyczek Algorytmicznych: uzywam gotowej biblioteki do obslugi duzych intow. Zrodlo:
https://gist.github.com/ar-pa/957297fb3f88996ead11
*/

/*
================================================ vvvvv BIBLIOTEKA vvvvv ================================================
*/

/*
  ######################################################################
  #######################   THE   BIG   INT   ##########################
*/
const int base = 1000000000;
const int base_digits = 9; 
struct bigint {
	vector<int> a;
	int sign;
	/*<arpa>*/
	int size(){
		if(a.empty())return 0;
		int ans=(a.size()-1)*base_digits;
		int ca=a.back();
		while(ca)
			ans++,ca/=10;
		return ans;
	}
	bigint operator ^(const bigint &v){
		bigint ans=1,a=*this,b=v;
		while(!b.isZero()){
			if(b%2)
				ans*=a;
			a*=a,b/=2;
		}
		return ans;
	}
	bigint modPow(bigint base, bigint exp, const bigint &mod) {
		bigint result = 1;
		base %= mod;
		while (!exp.isZero()) {
			if (exp % 2)
				result = (result * base) % mod;
			base = (base * base) % mod;
			exp /= 2;
		}
		return result;
	}
	string to_string(){
		stringstream ss;
		ss << *this;
		string s;
		ss >> s;
		return s;
	}
	int sumof(){
		string s = to_string();
		int ans = 0;
		for(auto c : s)  ans += c - '0';
		return ans;
	}
	/*</arpa>*/
	bigint() :
		sign(1) {
	}
 
	bigint(long long v) {
		*this = v;
	}
 
	bigint(const string &s) {
		read(s);
	}
 
	void operator=(const bigint &v) {
		sign = v.sign;
		a = v.a;
	}
 
	void operator=(long long v) {
		sign = 1;
		a.clear();
		if (v < 0)
			sign = -1, v = -v;
		for (; v > 0; v = v / base)
			a.push_back(v % base);
	}
 
	bigint operator+(const bigint &v) const {
		if (sign == v.sign) {
			bigint res = v;
 
			for (int i = 0, carry = 0; i < (int) max(a.size(), v.a.size()) || carry; ++i) {
				if (i == (int) res.a.size())
					res.a.push_back(0);
				res.a[i] += carry + (i < (int) a.size() ? a[i] : 0);
				carry = res.a[i] >= base;
				if (carry)
					res.a[i] -= base;
			}
			return res;
		}
		return *this - (-v);
	}
 
	bigint operator-(const bigint &v) const {
		if (sign == v.sign) {
			if (abs() >= v.abs()) {
				bigint res = *this;
				for (int i = 0, carry = 0; i < (int) v.a.size() || carry; ++i) {
					res.a[i] -= carry + (i < (int) v.a.size() ? v.a[i] : 0);
					carry = res.a[i] < 0;
					if (carry)
						res.a[i] += base;
				}
				res.trim();
				return res;
			}
			return -(v - *this);
		}
		return *this + (-v);
	}
 
	void operator*=(int v) {
		if (v < 0)
			sign = -sign, v = -v;
		for (int i = 0, carry = 0; i < (int) a.size() || carry; ++i) {
			if (i == (int) a.size())
				a.push_back(0);
			long long cur = a[i] * (long long) v + carry;
			carry = (int) (cur / base);
			a[i] = (int) (cur % base);
			//asm("divl %%ecx" : "=a"(carry), "=d"(a[i]) : "A"(cur), "c"(base));
		}
		trim();
	}
 
	bigint operator*(int v) const {
		bigint res = *this;
		res *= v;
		return res;
	}
 
	void operator*=(long long v) {
		if (v < 0)
			sign = -sign, v = -v;
		if(v > base){
			*this = *this * (v / base) * base + *this * (v % base);
			return ;
		}
		for (int i = 0, carry = 0; i < (int) a.size() || carry; ++i) {
			if (i == (int) a.size())
				a.push_back(0);
			long long cur = a[i] * (long long) v + carry;
			carry = (int) (cur / base);
			a[i] = (int) (cur % base);
			//asm("divl %%ecx" : "=a"(carry), "=d"(a[i]) : "A"(cur), "c"(base));
		}
		trim();
	}
 
	bigint operator*(long long v) const {
		bigint res = *this;
		res *= v;
		return res;
	}
 
	friend pair<bigint, bigint> divmod(const bigint &a1, const bigint &b1) {
		int norm = base / (b1.a.back() + 1);
		bigint a = a1.abs() * norm;
		bigint b = b1.abs() * norm;
		bigint q, r;
		q.a.resize(a.a.size());
 
		for (int i = a.a.size() - 1; i >= 0; i--) {
			r *= base;
			r += a.a[i];
			int s1 = r.a.size() <= b.a.size() ? 0 : r.a[b.a.size()];
			int s2 = r.a.size() <= b.a.size() - 1 ? 0 : r.a[b.a.size() - 1];
			int d = ((long long) base * s1 + s2) / b.a.back();
			r -= b * d;
			while (r < 0)
				r += b, --d;
			q.a[i] = d;
		}
 
		q.sign = a1.sign * b1.sign;
		r.sign = a1.sign;
		q.trim();
		r.trim();
		return make_pair(q, r / norm);
	}
 
	bigint operator/(const bigint &v) const {
		return divmod(*this, v).first;
	}
 
	bigint operator%(const bigint &v) const {
		return divmod(*this, v).second;
	}
 
	void operator/=(int v) {
		if (v < 0)
			sign = -sign, v = -v;
		for (int i = (int) a.size() - 1, rem = 0; i >= 0; --i) {
			long long cur = a[i] + rem * (long long) base;
			a[i] = (int) (cur / v);
			rem = (int) (cur % v);
		}
		trim();
	}
 
	bigint operator/(int v) const {
		bigint res = *this;
		res /= v;
		return res;
	}
 
	int operator%(int v) const {
		if (v < 0)
			v = -v;
		int m = 0;
		for (int i = a.size() - 1; i >= 0; --i)
			m = (a[i] + m * (long long) base) % v;
		return m * sign;
	}
 
	void operator+=(const bigint &v) {
		*this = *this + v;
	}
	void operator-=(const bigint &v) {
		*this = *this - v;
	}
	void operator*=(const bigint &v) {
		*this = *this * v;
	}
	void operator/=(const bigint &v) {
		*this = *this / v;
	}
	void operator%=(const bigint &v){
		*this = *this % v;
	} 
	bool operator<(const bigint &v) const {
		if (sign != v.sign)
			return sign < v.sign;
		if (a.size() != v.a.size())
			return a.size() * sign < v.a.size() * v.sign;
		for (int i = a.size() - 1; i >= 0; i--)
			if (a[i] != v.a[i])
				return a[i] * sign < v.a[i] * sign;
		return false;
	}
 
	bool operator>(const bigint &v) const {
		return v < *this;
	}
	bool operator<=(const bigint &v) const {
		return !(v < *this);
	}
	bool operator>=(const bigint &v) const {
		return !(*this < v);
	}
	bool operator==(const bigint &v) const {
		return !(*this < v) && !(v < *this);
	}
	bool operator!=(const bigint &v) const {
		return *this < v || v < *this;
	}
 
	void trim() {
		while (!a.empty() && !a.back())
			a.pop_back();
		if (a.empty())
			sign = 1;
	}
 
	bool isZero() const {
		return a.empty() || (a.size() == 1 && !a[0]);
	}
 
	bigint operator-() const {
		bigint res = *this;
		res.sign = -sign;
		return res;
	}
 
	bigint abs() const {
		bigint res = *this;
		res.sign *= res.sign;
		return res;
	}
 
	long long longValue() const {
		long long res = 0;
		for (int i = a.size() - 1; i >= 0; i--)
			res = res * base + a[i];
		return res * sign;
	}
 
	friend bigint gcd(const bigint &a, const bigint &b) {
		return b.isZero() ? a : gcd(b, a % b);
	}
	friend bigint lcm(const bigint &a, const bigint &b) {
		return a / gcd(a, b) * b;
	}
 
	void read(const string &s) {
		sign = 1;
		a.clear();
		int pos = 0;
		while (pos < (int) s.size() && (s[pos] == '-' || s[pos] == '+')) {
			if (s[pos] == '-')
				sign = -sign;
			++pos;
		}
		for (int i = s.size() - 1; i >= pos; i -= base_digits) {
			int x = 0;
			for (int j = max(pos, i - base_digits + 1); j <= i; j++)
				x = x * 10 + s[j] - '0';
			a.push_back(x);
		}
		trim();
	}
 
	friend istream& operator>>(istream &stream, bigint &v) {
		string s;
		stream >> s;
		v.read(s);
		return stream;
	}
 
	friend ostream& operator<<(ostream &stream, const bigint &v) {
		if (v.sign == -1)
			stream << '-';
		stream << (v.a.empty() ? 0 : v.a.back());
		for (int i = (int) v.a.size() - 2; i >= 0; --i)
			stream << setw(base_digits) << setfill('0') << v.a[i];
		return stream;
	}
 
	static vector<int> convert_base(const vector<int> &a, int old_digits, int new_digits) {
		vector<long long> p(max(old_digits, new_digits) + 1);
		p[0] = 1;
		for (int i = 1; i < (int) p.size(); i++)
			p[i] = p[i - 1] * 10;
		vector<int> res;
		long long cur = 0;
		int cur_digits = 0;
		for (int i = 0; i < (int) a.size(); i++) {
			cur += a[i] * p[cur_digits];
			cur_digits += old_digits;
			while (cur_digits >= new_digits) {
				res.push_back(int(cur % p[new_digits]));
				cur /= p[new_digits];
				cur_digits -= new_digits;
			}
		}
		res.push_back((int) cur);
		while (!res.empty() && !res.back())
			res.pop_back();
		return res;
	}
 
	typedef vector<long long> vll;
 
	static vll karatsubaMultiply(const vll &a, const vll &b) {
		int n = a.size();
		vll res(n + n);
		if (n <= 32) {
			for (int i = 0; i < n; i++)
				for (int j = 0; j < n; j++)
					res[i + j] += a[i] * b[j];
			return res;
		}
 
		int k = n >> 1;
		vll a1(a.begin(), a.begin() + k);
		vll a2(a.begin() + k, a.end());
		vll b1(b.begin(), b.begin() + k);
		vll b2(b.begin() + k, b.end());
 
		vll a1b1 = karatsubaMultiply(a1, b1);
		vll a2b2 = karatsubaMultiply(a2, b2);
 
		for (int i = 0; i < k; i++)
			a2[i] += a1[i];
		for (int i = 0; i < k; i++)
			b2[i] += b1[i];
 
		vll r = karatsubaMultiply(a2, b2);
		for (int i = 0; i < (int) a1b1.size(); i++)
			r[i] -= a1b1[i];
		for (int i = 0; i < (int) a2b2.size(); i++)
			r[i] -= a2b2[i];
 
		for (int i = 0; i < (int) r.size(); i++)
			res[i + k] += r[i];
		for (int i = 0; i < (int) a1b1.size(); i++)
			res[i] += a1b1[i];
		for (int i = 0; i < (int) a2b2.size(); i++)
			res[i + n] += a2b2[i];
		return res;
	}
 
	bigint operator*(const bigint &v) const {
		vector<int> a6 = convert_base(this->a, base_digits, 6);
		vector<int> b6 = convert_base(v.a, base_digits, 6);
		vll a(a6.begin(), a6.end());
		vll b(b6.begin(), b6.end());
		while (a.size() < b.size())
			a.push_back(0);
		while (b.size() < a.size())
			b.push_back(0);
		while (a.size() & (a.size() - 1))
			a.push_back(0), b.push_back(0);
		vll c = karatsubaMultiply(a, b);
		bigint res;
		res.sign = sign * v.sign;
		for (int i = 0, carry = 0; i < (int) c.size(); i++) {
			long long cur = c[i] + carry;
			res.a.push_back((int) (cur % 1000000));
			carry = (int) (cur / 1000000);
		}
		res.a = convert_base(res.a, 6, base_digits);
		res.trim();
		return res;
	}
};
/*
  #######################   THE   BIG   INT   ##########################
  ######################################################################
*/


/*
================================================ ^^^^^ BIBLIOTEKA ^^^^^ ================================================
*/

const unsigned int SECRET_SEED = 3188213416;

const bool ALGOSIA = false;
const bool BAJTEK = true;

const int PHASE_TIE = 0;
const int PHASE_LOSING = -1;
const int PHASE_WINNING = 1;

const char ROCK = 'K';
const char PAPER = 'P';
const char SCISSORS = 'N';

const bigint BIG_INT_0 = bigint(0);
const bigint BIG_INT_1 = bigint(1);

const int BIGGER_PART_NUMERATOR = 3;
const int BIGGER_PART_DENOMINATOR = 4;

int n;
int t;
char name_to_read[10];
char binary_chain[5100];
char magic_xor_chain[5100];
bool my_name;
bigint my_number;
bigint my_range_left;
bigint my_range_right;
bigint their_range_left;
bigint their_range_right;
int current_phase;
bool my_number_fully_sent;
bool their_number_fully_sent;

void xor_binary_chain() {
  for (int i = 0; i < n; i++) {
    binary_chain[i] = ((binary_chain[i] - '0') xor (magic_xor_chain[i] - '0')) + '0';
  }
}

void binary_chain_to_my_number() {
  my_number = BIG_INT_0;
  for (int i = 0; i < n; i++) {
    my_number *= 2;
    if (binary_chain[i] == '1') {
      my_number += BIG_INT_1;
    }
  }
}

void their_number_to_binary_chain() {
  for (int i = n - 1; i >= 0; i--) {
    if (their_range_left % 2 == 1) {
      binary_chain[i] = '1';
    } else {
      binary_chain[i] = '0';
    }
    their_range_left /= 2;
  }
}

void determine_if_numbers_fully_sent() {
  if (!my_number_fully_sent) {
    bigint diff = my_range_right;
    diff -= my_range_left;
    if (diff == BIG_INT_1) {
      my_number_fully_sent = true;
    }
  }

  if (!their_number_fully_sent) {
    bigint diff = their_range_right;
    diff -= their_range_left;
    if (diff == BIG_INT_1) {
      their_number_fully_sent = true;
    }
  }
}

void determine_phase(char my_message, char their_message) {
  if (my_message != their_message) { // if tie, current phase remains unchanged
    if (((my_message == ROCK) && (their_message == SCISSORS))
      || ((my_message == PAPER) && (their_message == ROCK))
      || ((my_message == SCISSORS) && (their_message == PAPER))) { // I won, advancing in phase...
        if (current_phase == PHASE_LOSING) {
          current_phase = PHASE_TIE;
        } else { // otherwise it means that there was tie and now I'm winning (it should not be possible that I was winning before that move!)
          current_phase = PHASE_WINNING;
        }
    } else { // otherwise it means that I lose, declining in phase...
      if (current_phase == PHASE_WINNING) {
        current_phase = PHASE_TIE;
      } else { // otherwise it means that there was tie and now I'm losing (it should not be possible that I was losing before that move!)
        current_phase = PHASE_LOSING;
      }
    }
  }
}

int main() {
  // read and set the name
  // (coming back after implementation is done - it seems that I don't need to know who I am... and after long day of debugging and optimisations I don't know my name anyway ;) anyway, leaving as is)
  scanf("%s", name_to_read);
  if (strcmp(name_to_read, "Algosia") == 0) {
    my_name = ALGOSIA;
  } else {
    my_name = BAJTEK;
  }

  // read n & t
  scanf("%d %d", &n, &t);

  // prepare magic random number for xoring
  srand(SECRET_SEED);
  for (int i = 0; i < n; i++) {
    magic_xor_chain[i] = (rand() % 2) + '0'; // to remember: stored as string for debug purposes mainly
  }
  magic_xor_chain[n] = '\0';

  // main loop over t cases
  for (int case_number = 1; case_number <= t; case_number++) {
    // read my number
    scanf("%s", binary_chain);

    // fprintf(stderr, "MY BINARY: !%s!\n", binary_chain);
    // fprintf(stderr, "MY MAGICN: %s\n", magic_xor_chain);

    // make the chain more random (xor using magic number)
    xor_binary_chain();
    
    // fprintf(stderr, "AFTER XOR: %s\n", binary_chain);

    // convert binary chain to big int (to my number)
    binary_chain_to_my_number();

    // fprintf(stderr, "CONVERTED: %s\n", my_number.toString().c_str());

    // set initial ranges (left <= number < right)
    my_range_left = BIG_INT_0;
    my_range_right = BIG_INT_1;
    for (int i = 0; i < n; i++) {
      my_range_right *= 2;
    }
    their_range_left = my_range_left;
    their_range_right = my_range_right;

    // fprintf(stderr, "THEIR RANGE RIGHT: %s\n", their_range_right.toString().c_str());

    // initialize phase and other variables
    current_phase = PHASE_TIE;
    my_number_fully_sent = false;
    their_number_fully_sent = false;

    // start the game!
    while (true) {

      char my_message;
      char their_message;

      if (current_phase == PHASE_TIE) { // I (and opponent) can pass 1 of 3 possible values (divide range into 3 equal subranges)

        // prepare my ranges and message
        if (my_number_fully_sent) { // if my number was already fully sent, we can send whatever (in case of tie) - let's say always ROCK
          my_message = ROCK;
        } else {
          // bigint my_one_third_length = (my_range_right - my_range_left + BIG_INT_1) / 3; // small optimisation vvv
          bigint my_one_third_length = my_range_right;
          my_one_third_length -= my_range_left;
          my_one_third_length += BIG_INT_1;
          my_one_third_length /= 3;
          if (my_one_third_length < BIG_INT_1) { // to not enter infinite loops near the end of the game, it needs to be at least 1!
            my_one_third_length = BIG_INT_1;
          }
          // bigint my_range_one_third = my_range_left + my_one_third_length; // small optimisation vvv
          bigint my_range_one_third = my_range_left;
          my_range_one_third += my_one_third_length;
          if (my_number < my_range_one_third) { // my number is in the first 1/3, send ROCK
            my_message = ROCK;
            my_range_right = my_range_one_third;
          } else {
            // bigint my_range_two_thirds = my_range_one_third + my_one_third_length; // small optimisation vvv
            bigint my_range_two_thirds = my_range_one_third;
            my_range_two_thirds += my_one_third_length;
            if (my_number < my_range_two_thirds) { // my number is in the second 1/3, send PAPER
              my_message = PAPER;
              my_range_left = my_range_one_third;
              my_range_right = my_range_two_thirds;
            } else { // otherwise it means that my number is in the third 1/3, send SCISSORS
              my_message = SCISSORS;
              my_range_left = my_range_two_thirds;
            }
          }
        }

        // send my message
        printf("%c\n", my_message);
        fflush(stdout);

        // read their message
        scanf(" %c", &their_message);

        // process their message
        if (!their_number_fully_sent) { // I need to process only if I don't know their number yet
          // bigint their_one_third_length = (their_range_right - their_range_left + BIG_INT_1) / 3; // small optimisation vvv
          bigint their_one_third_length = their_range_right;
          their_one_third_length -= their_range_left;
          their_one_third_length += BIG_INT_1;
          their_one_third_length /= 3;
          if (their_one_third_length < BIG_INT_1) { // to not enter infinite loops near the end of the game, it needs to be at least 1!
            their_one_third_length = BIG_INT_1;
          }
          // bigint their_range_one_third = their_range_left + their_one_third_length; // small optimisation vvv
          bigint their_range_one_third = their_range_left;
          their_range_one_third += their_one_third_length;
          if (their_message == ROCK) { // it means that their number is in the first 1/3
            their_range_right = their_range_one_third;
          } else {
            // bigint their_range_two_thirds = their_range_one_third + their_one_third_length; // small optimisation vvv
            bigint their_range_two_thirds = their_range_one_third;
            their_range_two_thirds += their_one_third_length;
            if (their_message == PAPER) { // it means that their number is in the second 1/3
              their_range_left = their_range_one_third;
              their_range_right = their_range_two_thirds;
            } else { // otherwise (SCISSORS) it means that their number is in the third 1/3
              their_range_left = their_range_two_thirds;
            }
          }
        }

      } else if (current_phase == PHASE_LOSING) { // if I'm losing, then opponent is passive (sends ROCK), and I'm active - sending them 1 of 2 possible values

        if (my_number_fully_sent) { // ... unless my number is already sent, then I'm passive (always sending ROCK), letting them to pass info

          // prepare my simple message - ROCK
          my_message = ROCK;

          // send my message
          printf("%c\n", my_message);
          fflush(stdout);

          // read their message
          scanf(" %c", &their_message);

          // process their message (I'm not checking if their number is fully sent - it should not happen...)
          // copy pasting from below (logic described below)
          // bigint their_bigger_part_length = (their_range_right - their_range_left + BIG_INT_1) * BIGGER_PART_NUMERATOR / BIGGER_PART_DENOMINATOR; // small optimisation vvv
          bigint their_bigger_part_length = their_range_right;
          their_bigger_part_length -= their_range_left;
          their_bigger_part_length += BIG_INT_1;
          their_bigger_part_length *= BIGGER_PART_NUMERATOR;
          their_bigger_part_length /= BIGGER_PART_DENOMINATOR;
          if (their_bigger_part_length < BIG_INT_1) { // to not enter infinite loops near the end of the game, it needs to be at least 1!
            their_bigger_part_length = BIG_INT_1;
          }
          // bigint their_range_mid_point = their_range_left + their_bigger_part_length; // small optimisation vvv
          bigint their_range_mid_point = their_range_left;
          their_range_mid_point += their_bigger_part_length;
          if (their_message == SCISSORS) { // I'm losing and I'm sending ROCK, so SCISSORS is sent by opponent to try to come back to tie for bigger subrange
            their_range_right = their_range_mid_point;
          } else { // otherwise they should send ROCK to tie now (hopefully...)
            their_range_left = their_range_mid_point;
          }

        } else {

          // prepare my ranges and message
          // I want to divide range disproportionately - to have bigger chance (wider range) to achieve state where I come back to the tie
          // (to be able to send 1 of 3 possible values each of us); or if I hit smaller range, at least I converge earlier;
          // proportion of range division determined empirically (75:25 seems to work OK; 75/100 = 3/4)
          // bigint my_bigger_part_length = (my_range_right - my_range_left + BIG_INT_1) * BIGGER_PART_NUMERATOR / BIGGER_PART_DENOMINATOR; // small optimisation vvv
          bigint my_bigger_part_length = my_range_right;
          my_bigger_part_length -= my_range_left;
          my_bigger_part_length += BIG_INT_1;
          my_bigger_part_length *= BIGGER_PART_NUMERATOR;
          my_bigger_part_length /= BIGGER_PART_DENOMINATOR;
          if (my_bigger_part_length < BIG_INT_1) { // to not enter infinite loops near the end of the game, it needs to be at least 1!
            my_bigger_part_length = BIG_INT_1;
          }
          // bigint my_range_mid_point = my_range_left + my_bigger_part_length; // small optimisation vvv
          bigint my_range_mid_point = my_range_left;
          my_range_mid_point += my_bigger_part_length;
          if (my_number < my_range_mid_point) { // my number is in the first bigger part, so send PAPER to win and achieve tie again
            my_message = PAPER;
            my_range_right = my_range_mid_point;
          } else { // otherwise it's in the smaller part, send ROCK to tie now
            my_message = ROCK;
            my_range_left = my_range_mid_point;
          }

          // send my message
          printf("%c\n", my_message);
          fflush(stdout);

          // read their message (and do nothing, ignore - they are passive side and should send ROCK [I hope it is ROCK...])
          scanf(" %c", &their_message);
        }

      } else { // otherwise I'm winning, so I'm passive (sending ROCK), and opponent is active - sending towards me 1 of 2 possible values

        if (their_number_fully_sent) { // ... unless their number is already sent, then they're passive (always sending ROCK), letting me to pass info

          // it's slightly modified copy paste from the above (from my_number_fully_sent == false [else] branch)...

          // prepare my ranges and message
          // bigint my_bigger_part_length = (my_range_right - my_range_left + BIG_INT_1) * BIGGER_PART_NUMERATOR / BIGGER_PART_DENOMINATOR; // small optimisation vvv
          bigint my_bigger_part_length = my_range_right;
          my_bigger_part_length -= my_range_left;
          my_bigger_part_length += BIG_INT_1;
          my_bigger_part_length *= BIGGER_PART_NUMERATOR;
          my_bigger_part_length /= BIGGER_PART_DENOMINATOR;
          if (my_bigger_part_length < BIG_INT_1) { // to not enter infinite loops near the end of the game, it needs to be at least 1!
            my_bigger_part_length = BIG_INT_1;
          }
          // bigint my_range_mid_point = my_range_left + my_bigger_part_length; // small optimisation vvv
          bigint my_range_mid_point = my_range_left;
          my_range_mid_point += my_bigger_part_length;
          if (my_number < my_range_mid_point) { // my number is in the first bigger part, so send SCISSORS to lose and achieve tie again
            my_message = SCISSORS;
            my_range_right = my_range_mid_point;
          } else { // otherwise it's in the smaller part, send ROCK to tie
            my_message = ROCK;
            my_range_left = my_range_mid_point;
          }

          // send my message
          printf("%c\n", my_message);
          fflush(stdout);

          // read their message (and do nothing, ignore - they are passive side and should send ROCK [I hope it is ROCK...])
          scanf(" %c", &their_message);

        } else {

          // it's slightly modified copy paste from the above (from my_number_fully_sent == true branch)...

          // prepare my simple message - ROCK
          my_message = ROCK;

          // send my message
          printf("%c\n", my_message);
          fflush(stdout);

          // read their message
          scanf(" %c", &their_message);

          // process their message (I'm not checking if my number is fully sent - it should not happen...)
          // bigint their_bigger_part_length = (their_range_right - their_range_left + BIG_INT_1) * BIGGER_PART_NUMERATOR / BIGGER_PART_DENOMINATOR; // small optimisation vvv
          bigint their_bigger_part_length = their_range_right;
          their_bigger_part_length -= their_range_left;
          their_bigger_part_length += BIG_INT_1;
          their_bigger_part_length *= BIGGER_PART_NUMERATOR;
          their_bigger_part_length /= BIGGER_PART_DENOMINATOR;
          if (their_bigger_part_length < BIG_INT_1) { // to not enter infinite loops near the end of the game, it needs to be at least 1!
            their_bigger_part_length = BIG_INT_1;
          }
          // bigint their_range_mid_point = their_range_left + their_bigger_part_length; // small optimisation vvv
          bigint their_range_mid_point = their_range_left;
          their_range_mid_point += their_bigger_part_length;
          if (their_message == PAPER) { // I'm winning and I'm sending ROCK, so PAPER is sent by opponent to try to come back to tie for bigger subrange
            their_range_right = their_range_mid_point;
          } else { // otherwise they should send ROCK to tie now (hopefully...)
            their_range_left = their_range_mid_point;
          }

        }

      }

      // check if my or their (or both) numbers are not fully sent (and reflect the state in proper variables)
      determine_if_numbers_fully_sent();

      // decide what's the phase after that exchange of messages
      determine_phase(my_message, their_message);

      // if we both know our numbers, it's time to send the opponents number and break the loop! (hopefully opponent does the same...)
      if (my_number_fully_sent && their_number_fully_sent) {
        // their number is equal to their_range_left - convert it to the binary chain
        their_number_to_binary_chain();

        // now reverse "making chain more random" by xoring by magic number again
        xor_binary_chain();

        // print response
        printf("! %s\n", binary_chain);
        fflush(stdout);

        // break the loop
        break;
      }
    }
  }

  return 0;
}