Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

bitmasks

constructive algorithms

interactive

math

*1800

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Take a Guess

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThis is an interactive task

William has a certain sequence of integers $$$a_1, a_2, \dots, a_n$$$ in his mind, but due to security concerns, he does not want to reveal it to you completely. William is ready to respond to no more than $$$2 \cdot n$$$ of the following questions:

- What is the result of a bitwise AND of two items with indices $$$i$$$ and $$$j$$$ ($$$i \neq j$$$)
- What is the result of a bitwise OR of two items with indices $$$i$$$ and $$$j$$$ ($$$i \neq j$$$)

You can ask William these questions and you need to find the $$$k$$$-th smallest number of the sequence.

Formally the $$$k$$$-th smallest number is equal to the number at the $$$k$$$-th place in a 1-indexed array sorted in non-decreasing order. For example in array $$$[5, 3, 3, 10, 1]$$$ $$$4$$$th smallest number is equal to $$$5$$$, and $$$2$$$nd and $$$3$$$rd are $$$3$$$.

Input

It is guaranteed that for each element in a sequence the condition $$$0 \le a_i \le 10^9$$$ is satisfied.

Interaction

In the first line you will be given two integers $$$n$$$ and $$$k$$$ $$$(3 \le n \le 10^4, 1 \le k \le n)$$$, which are the number of items in the sequence $$$a$$$ and the number $$$k$$$.

After that, you can ask no more than $$$2 \cdot n$$$ questions (not including the "finish" operation).

Each line of your output may be of one of the following types:

- "or i j" $$$(1 \le i, j \le n, i \neq j)$$$, where $$$i$$$ and $$$j$$$ are indices of items for which you want to calculate the bitwise OR.
- "and i j" $$$(1 \le i, j \le n, i \neq j)$$$, where $$$i$$$ and $$$j$$$ are indices of items for which you want to calculate the bitwise AND.
- "finish res", where $$$res$$$ is the $$$k$$$th smallest number in the sequence. After outputting this line the program execution must conclude.

In response to the first two types of queries, you will get an integer $$$x$$$, the result of the operation for the numbers you have selected.

After outputting a line do not forget to output a new line character and flush the output buffer. Otherwise you will get the "Idleness limit exceeded". To flush the buffer use:

- fflush(stdout) in C++
- System.out.flush() in Java
- stdout.flush() in Python
- flush(output) in Pascal
- for other languages refer to documentation

If you perform an incorrect query the response will be $$$-1$$$. After receiving response $$$-1$$$ you must immediately halt your program in order to receive an "Incorrect answer" verdict.

Hacking

To perform a hack you will need to use the following format:

The first line must contain two integers $$$n$$$ and $$$k$$$ $$$(3 \le n \le 10^4, 1 \le k \le n)$$$, which are the number of items in the sequence $$$a$$$ and the number $$$k$$$.

The second line must contain $$$n$$$ integers $$$a_1, a_2, \dots, a_n$$$ $$$(0 \le a_i \le 10^9)$$$, the sequence $$$a$$$.

Example

Input

7 6 2 7

Output

and 2 5 or 5 6 finish 5

Note

In the example, the hidden sequence is $$$[1, 6, 4, 2, 3, 5, 4]$$$.

Below is the interaction in the example.

Query (contestant's program) | Response (interactor) | Notes |

and 2 5 | 2 | $$$a_2=6$$$, $$$a_5=3$$$. Interactor returns bitwise AND of the given numbers. |

or 5 6 | 7 | $$$a_5=3$$$, $$$a_6=5$$$. Interactor returns bitwise OR of the given numbers. |

finish 5 | $$$5$$$ is the correct answer. Note that you must find the value and not the index of the kth smallest number. |

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/29/2024 07:08:24 (j2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|