description: <image>
  
  This is an interactive task
  
  William has a certain sequence of integers a_1, a_2, ..., 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 ⋅ n of the following questions:
  
    * What is the result of a [bitwise AND](https://en.wikipedia.org/wiki/Bitwise_operation#AND) of two items with indices i and j (i ≠ j) 
    * What is the result of a [bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) of two items with indices i and j (i ≠ 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] 4th smallest number is equal to 5, and 2nd and 3rd are 3.
  
  Input
  
  It is guaranteed that for each element in a sequence the condition 0 ≤ a_i ≤ 10^9 is satisfied.
  
  Interaction
  
  In the first line you will be given two integers n and k (3 ≤ n ≤ 10^4, 1 ≤ k ≤ n), which are the number of items in the sequence a and the number k.
  
  After that, you can ask no more than 2 ⋅ n questions (not including the "finish" operation).
  
  Each line of your output may be of one of the following types: 
  
    * "or i j" (1 ≤ i, j ≤ n, i ≠ j), where i and j are indices of items for which you want to calculate the bitwise OR. 
    * "and i j" (1 ≤ i, j ≤ n, i ≠ j), where i and j are indices of items for which you want to calculate the bitwise AND. 
    * "finish res", where res is the kth 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 ≤ n ≤ 10^4, 1 ≤ k ≤ 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, ..., a_n (0 ≤ a_i ≤ 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.
solution: import java.io.*;
  import java.util.*;
   
  public class Practice
  {
  	static int mod=1000000007;
  	static HashSet<Integer> pr;
  	static FastReader sc=new FastReader(System.in);
  //	static Reader sc=new Reader();
  	static  PrintWriter out=new PrintWriter(System.out);
  	public static void main(String[] args) throws IOException
  	{ 
  		int t=1;
  //		t=sc.nextInt();
  //		StringBuilder sb=new StringBuilder();
  		while(t-->0)
  		{
  			solve();
  //			sb.append("\n");
  		}
  //		out.print(sb);
  		out.close();
  		out.flush();
  	}
  	static class Pair
  	{
  		int x;	
  		int y;	
  		Pair(int a,int b)
  		{
  			x=a;
  			y=b;
  		}
  		@Override
  		public String toString() 
  		{
  			return x+" "+y;
  		}
  	}
  	static void arraySort(int arr[])
  	{
  		ArrayList<Integer> a=new ArrayList<Integer>();
  		for (int i = 0; i < arr.length; i++) {
  			a.add(arr[i]);
  		}
  		Collections.sort(a);
  		for (int i = 0; i < arr.length; i++) {
  			arr[i]=a.get(i);
  		}
  	}
  	static void solve() throws IOException
  	{
  		int n=sc.nextInt(),k=sc.nextInt(),pos=0;
  		int arr[]=new int[n];
  		out.println("and "+1+" "+(1+1));
  		out.flush();
  		int x=sc.nextInt();
  		out.println("or "+1+" "+(1+1));
  		out.flush();
  		int y=sc.nextInt();
  		long a=(x+y);
  		out.println("and "+(1+1)+" "+(1+2));
  		out.flush();
  		x=sc.nextInt();
  		out.println("or "+(1+1)+" "+(1+2));
  		out.flush();
  		y=sc.nextInt();
  		long b=x+y;
  		out.println("and "+(1)+" "+(1+2));
  		out.flush();
  		x=sc.nextInt();
  		out.println("or "+(1)+" "+(1+2));
  		out.flush();
  		y=sc.nextInt();
  		long c=x+y;
  		arr[1]=(int)((a+b-c)>>1);
  		arr[0]=(int)(a-arr[1]);
  		arr[2]=(int)(c-arr[0]);
  //		out.println(Arrays.toString(arr));
  		for(int i=3;i<n;i++)
  		{
  			out.println("and "+1+" "+(i+1));
  			out.flush();
  			x=sc.nextInt();
  			out.println("or "+1+" "+(i+1));
  			out.flush();
  			y=sc.nextInt();
  			long sum=(x+y);
  			arr[i]=(int)(sum-arr[0]);
  //			out.println(Arrays.toString(arr));
  		}
  		arraySort(arr);
  //		out.println(Arrays.toString(arr));
  		out.println("finish "+arr[k-1]);
  		out.flush();
  	}
  	static double dfs(Node ver,Node par)
  	{
  		if(ver.adj.size()==1 && ver.adj.get(0)==par)
  		{
  			return 0;
  		}
  		else
  		{
  			double sum=0,c=0;			
  			for(Node child: ver.adj)
  			if(child!=par)
  			{
  				c++;
  				sum+=dfs(child, ver);
  			}
  			return 1+(sum/c);
  		}
  	}
  	static int LOWER_BOUND(ArrayList<Integer> arr,int x)
  	{
  		int low=0,high=arr.size();
  		int ans=0;
  		while(low<=high)
  		{
  			int mid=(low+high)/2;
  			if(arr.get(mid)==x)
  			{
  				ans=arr.get(mid);
  				break;
  			}
  			else if(arr.get(mid)<x)
  			{
  				ans=arr.get(mid);
  				low=mid+1;
  			}
  			else
  				high=mid-1;
  		}
  		return ans;
  	}
  	static int gcd(int a,int b)
  	{
  		return (b==0)?a:gcd(b,a%b);
  	}
  	static class UnionFind
  	{
  		  private int size;
  		  private int[] sz;
  		  private int[] parent;
  		  private int numComponents;
  		  public UnionFind(int size,Pair dancers[]) 
  		  {
  		    if (size <= 0) throw new IllegalArgumentException("Size <= 0 is not allowed");
  		    this.size = numComponents = size;
  		    sz = new int[size];
  		    parent = new int[size];
  		    for (int i = 0; i < size; i++) 
  		    {
  		      parent[i] = i; 									// Link to itself (self root)
  		      sz[i] = 1; 										// Each component is originally of size one
  		    }
  		  }
  		  public int find(int p) 
  		  {
  		    int root = p;
  		    while (root != parent[root])
  		    	root = parent[root];
  		    while (p != root)
  		    {
  		      int next = parent[p];
  		      parent[p] = root;
  		      p = next;
  		    }
  		    return root;
  		  }
  		  public boolean isConnected(int p, int q) 
  		  {
  		    return find(p) == find(q);
  		  }
  		  public int componentSize(int x) 
  		  {
  		    return sz[find(x)];
  		  }
  		  public int size() 
  		  {
  		    return size;
  		  }
  		  public int components() 
  		  {
  		    return numComponents;
  		  }
  		  public void unify(int p, int q) 
  		  {
  		    int root1 = find(p);
  		    int root2 = find(q);
  		    if(root1==root2)
  		    {
  		    	return;
  		    }
  		    else if (sz[root1] < sz[root2]) 
  		    {
  		    	parent[root1] = root2;
  		    	sz[root2] += sz[root1];
  		    	sz[root1] = 0;
  		  } 
  		    else 
  		    {
  		    	parent[root2] = root1;
  		    	sz[root1] += sz[root2];
  		    	sz[root2] = 0;
  		    }
  		    numComponents--;
  		  }
  		  void calc()
  		  {
  			  for(int i=0;i<size;i++)
  				  find(i);
  			  
  		  }
  	}
  	static class Node
  	{
  		int vertex;
  		ArrayList<Node> adj;
  		boolean rec;
  		boolean vis;
  		int color;
  		Node(int v)
  		{
  			vertex=v;
  			adj=new ArrayList<Node>();
  			vis=false;
  			color=-1;
  		}
  		@Override
  		public String toString() 
  		{
  			return vertex+" ";
  		}
  	}
  	static class Edge
  	{
  		Node a;
  		Node b;
  		Edge(Node m,Node n)
  		{
  			this.a=m;
  			this.b=n;
  		}
  		@Override
  		public String toString() {
  			return a.vertex+" "+b.vertex;
  		}
  	}
  	static long power(long x, long y)
  	  {
  	    long res = 1; 
  	    x = x % mod; 
  	    if (x == 0)
  	      return 0; 
  	    while (y > 0)
  	    {
  	    	if ((y & 1) != 0)
  	    		res = (res * x) % mod;
  	    	
  	    	y = y >> 1; // y = y/2
  	    	x = (x * x) % mod;
  	    }
  	    return res;
  	  }
  	static long binomialCoeff(long n, long k)
      {
          long res = 1;
          if(k>n)
          	return 0;
          // Since C(n, k) = C(n, n-k)
          if (k > n - k)
              k = n - k;
   
          // Calculate value of
          // [n * (n-1) *---* (n-k+1)] / [k * (k-1) *----* 1]
          for (long i = 0; i < k; ++i) {
              res *= (n - i);
              res /= (i + 1);
          }
   
          return res;
      }
  	static class FastReader
  	{
          byte[] buf = new byte[2048];
          int index, total;
          InputStream in;
   
          FastReader(InputStream is) 
          {
              in = is;
          }
   
          int scan() throws IOException 
          {
              if (index >= total) {
                  index = 0;
                  total = in.read(buf);
                  if (total <= 0) {
                      return -1;
                  }
              }
              return buf[index++];
          }
   
          String next() throws IOException 
          {
              int c;
              for (c = scan(); c <= 32; c = scan());
              StringBuilder sb = new StringBuilder();
              for (; c > 32; c = scan()) {
                  sb.append((char) c);
              }
              return sb.toString();
          }
   
          int nextInt() throws IOException 
          {
              int c, val = 0;
              for (c = scan(); c <= 32; c = scan());
              boolean neg = c == '-';
              if (c == '-' || c == '+') {
                  c = scan();
              }
              for (; c >= '0' && c <= '9'; c = scan()) {
                  val = (val << 3) + (val << 1) + (c & 15);
              }
              return neg ? -val : val;
          }
   
          long nextLong() throws IOException 
          {
              int c;
              long val = 0;
              for (c = scan(); c <= 32; c = scan());
              boolean neg = c == '-';
              if (c == '-' || c == '+') {
                  c = scan();
              }
              for (; c >= '0' && c <= '9'; c = scan()) {
                  val = (val << 3) + (val << 1) + (c & 15);
              }
              return neg ? -val : val;
          }
      }
  	static class Reader 
  	{
          final private int BUFFER_SIZE = 1 << 16;
          private DataInputStream din;
          private byte[] buffer;
          private int bufferPointer, bytesRead;
   
          public Reader()
          {
              din = new DataInputStream(System.in);
              buffer = new byte[BUFFER_SIZE];
              bufferPointer = bytesRead = 0;
          }
   
          public Reader(String file_name) throws IOException
          {
              din = new DataInputStream(
                  new FileInputStream(file_name));
              buffer = new byte[BUFFER_SIZE];
              bufferPointer = bytesRead = 0;
          }
   
          public String readLine() throws IOException
          {
              byte[] buf = new byte[64]; // line length
              int cnt = 0, c;
              while ((c = read()) != -1) {
                  if (c == '\n') {
                      if (cnt != 0) {
                          break;
                      }
                      else {
                          continue;
                      }
                  }
                  buf[cnt++] = (byte)c;
              }
              return new String(buf, 0, cnt);
          }
   
          public int nextInt() throws IOException
          {
              int ret = 0;
              byte c = read();
              while (c <= ' ') {
                  c = read();
              }
              boolean neg = (c == '-');
              if (neg)
                  c = read();
              do {
                  ret = ret * 10 + c - '0';
              } while ((c = read()) >= '0' && c <= '9');
   
              if (neg)
                  return -ret;
              return ret;
          }
   
          public long nextLong() throws IOException
          {
              long ret = 0;
              byte c = read();
              while (c <= ' ')
                  c = read();
              boolean neg = (c == '-');
              if (neg)
                  c = read();
              do {
                  ret = ret * 10 + c - '0';
              } while ((c = read()) >= '0' && c <= '9');
              if (neg)
                  return -ret;
              return ret;
          }
   
          public double nextDouble() throws IOException
          {
              double ret = 0, div = 1;
              byte c = read();
              while (c <= ' ')
                  c = read();
              boolean neg = (c == '-');
              if (neg)
                  c = read();
   
              do {
                  ret = ret * 10 + c - '0';
              } while ((c = read()) >= '0' && c <= '9');
   
              if (c == '.') {
                  while ((c = read()) >= '0' && c <= '9') {
                      ret += (c - '0') / (div *= 10);
                  }
              }
   
              if (neg)
                  return -ret;
              return ret;
          }
   
          private void fillBuffer() throws IOException
          {
              bytesRead = din.read(buffer, bufferPointer = 0,
                                   BUFFER_SIZE);
              if (bytesRead == -1)
                  buffer[0] = -1;
          }
   
          private byte read() throws IOException
          {
              if (bufferPointer == bytesRead)
                  fillBuffer();
              return buffer[bufferPointer++];
          }
   
          public void close() throws IOException
          {
              if (din == null)
                  return;
              din.close();
          }
          public void printarray(int arr[])
          {
          	for (int i = 0; i < arr.length; i++)
  				System.out.print(arr[i]+" ");
          	System.out.println();
          }
      }
  }
  
  
  
  
  
  
  
  
  