/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 998244353ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;
#ifndef death
#include "vision.h"
#endif
#ifdef death
int add_not(int x)
{
cout << "add_not " << x << endl;
}
int add_and(vector<int> a)
{
cout << "add_and ";
for (int i = 0; i < a.size(); i++)
cout << a[i] << " ";
cout << endl;
}
int add_or(vector<int> a)
{
cout << "add_or ";
for (int i = 0; i < a.size(); i++)
cout << a[i] << " ";
cout << endl;
}
int add_xor(vector<int> a)
{
cout << "add_xor ";
for (int i = 0; i < a.size(); i++)
cout << a[i] << " ";
cout << endl;
}
#endif
int n, m, k;
int ind(int y, int x)
{
return y * m + x;
}
int id;
vector<vector<int>> p;
void construct_network(int H, int W, int K)
{
n = H;
m = W;
k = K;
id = n * m;
vector<int> last;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
{
vector<int> x;
for (int I = 0; I < n; I++)
for (int J = 0; J < m; J++)
if (abs(i - I) + abs(j - J) == k && ind(i, j) > ind(I, J))
x.PB(ind(I, J));
if (x.empty())
continue;
add_xor(x);
id++;
x.clear();
x.PB(id - 1);
x.PB(ind(i, j));
add_and(x);
id++;
last.PB(id - 1);
}
add_or(last);
}
#ifdef death
int main()
{
int N, M, K;
cin >> N >> M >> K;
construct_network(N, M, K);
return 0;
}
#endif
/*
*/
