位运算结论：a + b = (a & b) + (a | b)

//https://codeforces.com/problemset/problem/1556/D
#include<bits/stdc++.h>
#include<unordered_map>
#include<array>
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(),a.end()
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;

const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-4;
const ll mod = 1e5 + 3;
const int N = 1e4 + 5;

/*
结论 : a + b = (a & b) + (a | b)
*/

#define int ll
int n, k, a[N];

void ask(int& xx, int p, int q)
{
	cout << "or " << p << ' ' << q << '\n';
	cout.flush();
	int x;
	cin >> x;
	xx += x;
	cout << "and " << p << ' ' << q << '\n';
	cout.flush();
	cin >> x;
	xx += x;
}

void solve()
{
	cin >> n >> k;
	for (int i = 1; i + 2 <= n; i += 3)
	{
		int x1 = 0, x2 = 0, x3 = 0;
		ask(x1, i, i + 1);
		ask(x2, i + 1, i + 2);
		ask(x3, i, i + 2);
		a[i] = (x1 - x2 + x3) / 2;
		a[i + 1] = (x1 + x2 - x3) / 2;
		a[i + 2] = (x3 - x1 + x2) / 2;
	}
	if (n % 3 == 1)
	{
		int x = 0;
		ask(x, 1, n);
		a[n] = x - a[1];
	}
	else if (n % 3 == 2)
	{
		int x = 0;
		ask(x, 1, n - 1);
		a[n - 1] = x - a[1];
		x = 0;
		ask(x, 1, n);
		a[n] = x - a[1];
	}

	sort(a + 1, a + 1 + n);
	cout << "finish " << a[k] << '\n';
}

signed main()
{
	//IOS;
	int t = 1;
	//cin >> t;
	while (t--)
		solve();
	return 0;
}