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.util.*;
  import java.util.Map.Entry;
  
  
  import java.io.*;
  import static java.util.Map.Entry.*;
  
  /* Name of the class has to be "Main" only if the class is public. */
  public class Main
  {
  	static long mod=(long) (1e9+7);  
  	public static void main (String[] args) throws Exception
  	{
  		
  		final long mod1=(long) 1e9+7;
  		Reader s=new Reader();
  		  PrintWriter pt=new PrintWriter(System.out);
  		  
  		  BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
  //		  int T=Integer.parseInt(br.readLine());
  //		  int T=s.nextInt();
  //		  System.out.println(T);
  		  int T=1;
  		  ol:while(T-->0) {
  			  int n=s.nextInt();
  			  int k=s.nextInt();
  			  System.out.println("and 1 2");
  			  int a12=s.nextInt();
  			  System.out.println("or 1 2");
  			  int o12=s.nextInt();
  			  System.out.println("and 1 3");
  			  int a13=s.nextInt();
  			  System.out.println("or 1 3");
  			  int o13=s.nextInt();
  			  System.out.println("and 2 3");
  			  int a23=s.nextInt();
  			  System.out.println("or 2 3");
  			  int o23=s.nextInt();
  			  long sum=(0l+a12+a13+a23+o12+o23+o13)/2;
  			  long s12=a12+o12;
  			  long s23=a23+o23;
  			  long s13=a13+o13;
  			  long arr[]=new long[n];
  			  arr[0]=sum-s23;
  			  arr[1]=sum-s13;
  			  arr[2]=sum-s12;
  //			  System.out.println(arr[0]+" "+arr[1]+" "+arr[2]);
  			  for(int i=3;i<n;i++) {
  				  System.out.println("or 1 "+(i+1));
  				  int o=s.nextInt();
  				  System.out.println("and 1 "+(i+1));
  				  int a=s.nextInt();
  				  arr[i]=0l+a+o-arr[0];
  			  }
  			  sort(arr, 0, n-1);
  			  System.out.println("finish "+arr[k-1]);
  			  
  		  }
  		  
  		  
  		  pt.close();
  	}
  	
  	/**
  	 * Seive
  	 *
  	 * @param n length
  	 * @param factors factors[num] is smallest prime divisor of num
  	 * @param ar list of primes
  	 */
  	static void sieveOfEratosthenes(int n, int factors[], ArrayList<Integer> ar) 
      { 
          factors[1]=1;
          int p;
          for(p = 2; p*p <=n; p++) 
          { 
              if(factors[p] == 0) 
              { 
                  ar.add(p);
                  factors[p]=p;
                  for(int i = p*p; i <= n; i += p) 
                      if(factors[i]==0)
                          factors[i] = p; 
              } 
          }
          for(;p<=n;p++){
              if(factors[p] == 0) 
              { 
                  factors[p] = p;
                  ar.add(p);
              } 
          }
      }
  	
  	
  	static int binarySearch(int arr[], int x)
      {
          int l = 0, r = arr.length - 1;
          while (l <= r) {
              int m = l + (r - l) / 2;
    
              // Check if x is present at mid
              if (arr[m] == x)
                  return m;
    
              // If x greater, ignore left half
              if (arr[m] < x)
                  l = m + 1;
    
              // If x is smaller, ignore right half
              else
                  r = m - 1;
          }
    
          // if we reach here, then element was
          // not present
          return -1;
      }
  	
  	
  	public static int getFreq(int arr[], int n) {
  		int k=0;
  		for(int i=0;i<arr.length;i++) {
  			if(arr[i]==n)
  				k++;
  		}
  		return k;
  	}
  	
  	public static void primeFactors(int n)
      {
          // Print the number of 2s that divide n
  		HashMap<Integer, Integer> hm=new HashMap<Integer, Integer>();
          while (n%2==0)
          {
              hm.put(2, hm.getOrDefault(2, 0)+1);
              n/=2;
          }
   
          // n must be odd at this point.  So we can
          // skip one element (Note i = i +2)
          for (int i = 3; i <= Math.sqrt(n); i+= 2)
          {
              // While i divides n, print i and divide n
              while (n%i == 0)
              {
                  n /= i;
                  hm.put(i, hm.getOrDefault(i, 0)+1);
              }
          }
   
          // This condition is to handle the case whien
          // n is a prime number greater than 2
          if (n > 2)
          	hm.put(n, hm.getOrDefault(n, 0)+1);
      }
  
  
  	
  	static boolean isPartition(int arr[], int n) {
  		int sum = 0;
  	    int i, j;
  	 
  	    // Calculate sum of all elements
  	    for (i = 0; i < n; i++)
  	        sum += arr[i];
  	 
  	    if (sum % 2 != 0)
  	        return false;
  	 
  	    boolean part[][]=new boolean[sum/2+1][n+1];
  	 
  	    // initialize top row as true
  	    for (i = 0; i <= n; i++)
  	        part[0][i] = true;
  	 
  	    // initialize leftmost column, except part[0][0], as false
  	    for (i = 1; i <= sum / 2; i++)
  	        part[i][0] = false;
  	 
  	    // Fill the partition table in bottom up manner
  	    for (i = 1; i <= sum / 2; i++) {
  	        for (j = 1; j <= n; j++) {
  	            part[i][j] = part[i][j - 1];
  	            if (i >= arr[j - 1])
  	                part[i][j] = part[i][j]
  	                             || part[i - arr[j - 1]][j - 1];
  	        }
  	    }
  	    return part[sum / 2][n];
  	}
  	
  	static int setBit(int S, int j) { return S | 1 << j; }
  
  	static int clearBit(int S, int j) { return S & ~(1 << j); }
  
  	static int toggleBit(int S, int j) { return S ^ 1 << j; }
  
  	static boolean isOn(int S, int j) { return (S & 1 << j) != 0; }
  
  	static int turnOnLastZero(int S) { return S | S + 1; }
  	
  	static int turnOnLastConsecutiveZeroes(int S) { return S | S - 1; }
  	
  	static int turnOffLastBit(int S) { return S & S - 1; }
  	
  	static int turnOffLastConsecutiveBits(int S) { return S & S + 1; }
  
  	static int lowBit(int S) { return S & -S; }
  
  	static int setAll(int N) { return (1 << N) - 1; }
  
  	static int modulo(int S, int N) { return (S & N - 1); }		 //S%N, N is a power of 2
  
  	static boolean isPowerOfTwo(int S) { return (S & S - 1) == 0; }
  	
  	static boolean isWithin(long x, long y, long d, long k) {
  		return x*k*x*k + y*k*y*k <= d*d;
  	}
  	
  	static long modFact(long n, 
              long p) 
  	{ 
  		if (n >= p) 
  		 return 0; 
  		
  		long result = 1; 
  		for (int i = 1; i <= n; i++) 
  		 result = (result * i) % p; 
  		
  		return result; 
  	} 
  	static int sum(int[] arr, int n)
  	{
  	    int inc[]=new int[n+1];
  	    int dec[]=new int[n+1];
  	    inc[0] = arr[0];
  	    dec[0] = arr[0];
  
  	    for (int i = 1; i < n; i++) {
  	        for (int j = 0; j < i; j++) {
  	            if (arr[j] > arr[i]) {
  	                dec[i] = max(dec[i], inc[j] + arr[i]);
  	            }
  	            else if (arr[i] > arr[j]) {
  	                inc[i] = max(inc[i], dec[j] + arr[i]);
  	            }
  	        }
  	    }
  	    return max(inc[n - 1], dec[n - 1]);
  	}
  	static long nc2(long a) {
  		return a*(a-1)/2;
  	}
  	public static int numberOfprimeFactors(int n) 
      { 
          // Print the number of 2s that divide n 
  		HashSet<Integer> hs = new HashSet<Integer>();
          while (n%2==0) 
          { 
              hs.add(2);
              n /= 2; 
          } 
    
          // n must be odd at this point.  So we can 
          // skip one element (Note i = i +2) 
          for (int i = 3; i <= Math.sqrt(n); i+= 2) 
          { 
              // While i divides n, print i and divide n 
              while (n%i == 0) 
              { 
                  hs.add(i);
                  n /= i; 
              } 
          } 
    
          // This condition is to handle the case whien 
          // n is a prime number greater than 2 
          if (n > 2) 
              hs.add(n);
          return hs.size();
      } 
  	static long gcd(long a, long b) 
      { 
        if (b == 0) 
          return a; 
        return gcd(b, a % b);  
      } 
  
  
  
  
  	
  
  	static void reverse(int arr[],int start, int end) 
  	{ 
  		int temp; 
  		   
  		while (start < end) 
  		{ 
  		    temp = arr[start];  
  		    arr[start] = arr[end]; 
  		    arr[end] = temp; 
  		    start++; 
  		    end--; 
  		}  
  	}  
  	static void reverse(long arr[],int start, int end) 
  	{ 
  		long temp; 
  		   
  		while (start < end) 
  		{ 
  		    temp = arr[start];  
  		    arr[start] = arr[end]; 
  		    arr[end] = temp; 
  		    start++; 
  		    end--; 
  		}  
  	}  
  	static boolean isPrime(int n) 
      { 
          // Corner cases 
          if (n <= 1) return false; 
          if (n <= 3) return true; 
        
          // This is checked so that we can skip  
          // middle five numbers in below loop 
          if (n % 2 == 0 || n % 3 == 0) return false; 
        
          for (int i = 5; i * i <= n; i = i + 6) 
              if (n % i == 0 || n % (i + 2) == 0) 
              return false; 
        
          return true; 
      } 
  	static int p2(int n) {
  		int k=0;
  		while(n>1) {
  			if(n%2!=0)
  				return k;
  			n/=2;
  			k++;
  		}
  		return k;
  	}
  	static boolean isp2(int n) {
  		while(n>1) {
  			if(n%2==1)
  				return false;
  			n/=2;
  		}
  		return true;
  	}
  	static int binarySearch(int arr[], int first, int last, int key){  
  		   int mid = (first + last)/2;  
  		   while( first <= last ){  
  		      if ( arr[mid] < key ){  
  		        first = mid + 1;     
  		      }else if ( arr[mid] == key ){  
  		        return mid;  
  		      }else{  
  		         last = mid - 1;  
  		      }  
  		      mid = (first + last)/2;  
  		   }  
  		   return -1;
  		 }  
  
  	static void print(int a[][]) {
  		for(int i=0;i<a.length;i++)
  		{
  			for(int j=0;j<a[0].length;j++)
  				System.out.print(a[i][j]+" ");
  			System.out.println();
  		}
  	}
  	static int max (int x, int y) {
  		return (x > y)? x : y;
  	} 
  	static int search(Pair[] p, Pair pair) {
  		int l=0, r=p.length;
  		while (l <= r) { 
  	        int m = l + (r - l) / 2;
  	        if (p[m].compareTo(pair)==0) 
  	            return m; 
  	        if (p[m].compareTo(pair)<0) 
  	            l = m + 1; 
  	        else
  	            r = m - 1;
  	    }
  	    return -1;
  	}
  	static void pa(int a[])
  	{
  		for(int i=0;i<a.length;i++)
  			System.out.print(a[i]+" ");
  		System.out.println();
  		
  	}
  	static void pa(long a[])
  	{
  		for(int i=0;i<a.length;i++)
  			System.out.print(a[i]+" ");
  		System.out.println();
  		
  	}
  	static void reverseArray(int arr[], 
              int start, int end) 
  	{ 
  		int temp; 
  		   
  		while (start < end) 
  		{ 
  		    temp = arr[start];  
  		    arr[start] = arr[end]; 
  		    arr[end] = temp; 
  		    start++; 
  		    end--; 
  		}  
  	}     
  	static boolean isPalindrome(String s) {
  		int l=s.length();
  		for(int i=0;i<l/2;i++)
  		{
  			if(s.charAt(i)!=s.charAt(l-i-1))
  				return false;
  		}
  		return true;
  	}
  	static long nc2(long n, long m) {
  		return (n*(n-1)/2)%m;
  	}
  	static long c(long a) {
  		return a*(a+1)/2;
  	}
  	static int next(int[] arr, int target)  
      {  
          int start = 0, end = arr.length - 1;  
      
          int ans = -1;  
          while (start <= end) {  
              int mid = (start + end) / 2;  
      
              // Move to right side if target is  
              // greater.  
              if (arr[mid] < target) {
                  start = mid + 1;  
              }  
      
              // Move left side.  
              else {  
                  ans = mid;  
                  end = mid - 1;  
              }  
          }  
          return ans;  
      } 
  	
  	static int prev(Pair[] arr, int target)  
      {  
          int start = 0, end = arr.length - 1;  
      
          int ans = -1;  
          while (start <= end) {  
              int mid = (start + end) / 2;  
      
              // Move to left side if target is  
              // lesser.  
              if (arr[mid].a > target) {
                  end = mid - 1;  
              }  
      
              // Move right side.  
              else {  
                  ans = mid;  
                  start = mid + 1;  
              }  
          }  
          return ans;  
      } 
  
  	static long power(long x, long y, long p) 
      { 
          long res = 1; 
          x = x % p; 
                        
          while (y > 0) 
          { 
              if (y % 2 == 1) 
                  res = (res * x) % p; 
              y = y >> 1;
              x = (x * x) % p; 
          } 
          return  res; 
      } 
      static long modInverse(long n, long p) 
      { 
          return power(n, p-2, p); 
      } 
      static long nCrModP(long n, long r, 
                                      long p) 
      { 
          if(r>n)
          	return 0;
      	if (r == 0) 
              return 1; 
          long[] fac = new long[(int) (n+1)]; 
          fac[0] = 1; 
          for (int i = 1 ;i <= n; i++) 
              fac[i] = fac[i-1] * i % p;
          return (fac[(int) n]* modInverse(fac[(int) r], p) 
                  % p * modInverse(fac[(int) (n-r)], p) 
                                      % p) % p; 
      } 
  	static String reverse(String str)
  	{
  		return new StringBuffer(str).reverse().toString();
  	}
  
  
  
  	static long fastpow(long x, long y, long m)  
      { 
          if (y == 0) 
              return 1; 
            
          long p = fastpow(x, y / 2, m) % m; 
          p = (p * p) % m; 
        
          if (y % 2 == 0) 
              return p; 
          else
              return (x * p) % m; 
      } 
  	
  	static boolean isPerfectSquare(long l)
  	{
  		return Math.pow((long)Math.sqrt(l),2)==l;
  	}
  	
  	
  	static void merge(long[] arr, int l, int m, int r) 
      { 
          // Find sizes of two subarrays to be merged 
          int n1 = m - l + 1; 
          int n2 = r - m; 
    
          /* Create temp arrays */
          long L[] = new long [n1]; 
          long R[] = new long [n2]; 
    
          /*Copy data to temp arrays*/
          for (int i=0; i<n1; ++i) 
              L[i] = arr[l + i]; 
          for (int j=0; j<n2; ++j) 
              R[j] = arr[m + 1+ j]; 
    
    
          /* Merge the temp arrays */
    
          // Initial indexes of first and second subarrays 
          int i = 0, j = 0; 
    
          // Initial index of merged subarry array 
          int k = l; 
          while (i < n1 && j < n2) 
          { 
              if (L[i] <= R[j]) 
              { 
                  arr[k] = L[i]; 
                  i++; 
              } 
              else
              { 
                  arr[k] = R[j]; 
                  j++; 
              } 
              k++; 
          } 
    
          /* Copy remaining elements of L[] if any */
          while (i < n1) 
          { 
              arr[k] = L[i]; 
              i++; 
              k++; 
          } 
    
          /* Copy remaining elements of R[] if any */
          while (j < n2) 
          { 
              arr[k] = R[j]; 
              j++; 
              k++; 
          } 
      } 
    
      // Main function that sorts arr[l..r] using 
      // merge() 
      static void sort(int arr[], int l, int r) 
      { 
          if (l < r) 
          { 
              // Find the middle point 
              int m = (l+r)/2; 
    
              // Sort first and second halves 
              sort(arr, l, m); 
              sort(arr , m+1, r); 
    
              // Merge the sorted halves 
              merge(arr, l, m, r); 
          } 
      } 
  	static void merge(int arr[], int l, int m, int r) 
      { 
          // Find sizes of two subarrays to be merged 
          int n1 = m - l + 1; 
          int n2 = r - m; 
    
          /* Create temp arrays */
          int L[] = new int [n1]; 
          int R[] = new int [n2]; 
    
          /*Copy data to temp arrays*/
          for (int i=0; i<n1; ++i) 
              L[i] = arr[l + i]; 
          for (int j=0; j<n2; ++j) 
              R[j] = arr[m + 1+ j]; 
    
    
          /* Merge the temp arrays */
    
          // Initial indexes of first and second subarrays 
          int i = 0, j = 0; 
    
          // Initial index of merged subarry array 
          int k = l; 
          while (i < n1 && j < n2) 
          { 
              if (L[i] <= R[j]) 
              { 
                  arr[k] = L[i]; 
                  i++; 
              } 
              else
              { 
                  arr[k] = R[j]; 
                  j++; 
              } 
              k++; 
          } 
    
          /* Copy remaining elements of L[] if any */
          while (i < n1) 
          { 
              arr[k] = L[i]; 
              i++; 
              k++; 
          } 
    
          /* Copy remaining elements of R[] if any */
          while (j < n2) 
          { 
              arr[k] = R[j]; 
              j++; 
              k++; 
          } 
      } 
    
      // Main function that sorts arr[l..r] using 
      // merge() 
      static void sort(long arr[], int l, int r) 
      { 
          if (l < r) 
          { 
              // Find the middle point 
              int m = (l+r)/2; 
    
              // Sort first and second halves 
              sort(arr, l, m); 
              sort(arr , m+1, r); 
    
              // Merge the sorted halves 
              merge(arr, l, m, r); 
          } 
      } 
      static class Pair implements Comparable<Pair>{
          int a;
          int b;
          Pair(int a,int b){
              this.a=a;
   
              this.b=b;
          }   
          public int compareTo(Pair p){
              if(a>p.a)
                  return 1;
              if(a==p.a)
                  return (b-p.b);
              return -1;
          }
      }
  	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[128]; // line length 
              int cnt = 0, c; 
              while ((c = read()) != -1) 
              { 
                  if (c == '\n') 
                      break; 
                  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(); 
          } 
      } 
  }