#define LOCAL #include using namespace std; #pragma region Macros typedef long long ll; typedef __int128_t i128; typedef unsigned int uint; typedef unsigned long long ull; #define ALL(x) (x).begin(), (x).end() template istream& operator>>(istream& is, vector& v) { for (T& x : v) is >> x; return is; } template ostream& operator<<(ostream& os, const vector& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? "" : " "); } return os; } template ostream& operator<<(ostream& os, const pair& p) { os << '(' << p.first << ',' << p.second << ')'; return os; } template ostream& operator<<(ostream& os, const tuple& t) { os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')'; return os; } template ostream& operator<<(ostream& os, const tuple& t) { os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')'; return os; } template ostream& operator<<(ostream& os, const map& m) { os << '{'; for (auto itr = m.begin(); itr != m.end();) { os << '(' << itr->first << ',' << itr->second << ')'; if (++itr != m.end()) os << ','; } os << '}'; return os; } template ostream& operator<<(ostream& os, const unordered_map& m) { os << '{'; for (auto itr = m.begin(); itr != m.end();) { os << '(' << itr->first << ',' << itr->second << ')'; if (++itr != m.end()) os << ','; } os << '}'; return os; } template ostream& operator<<(ostream& os, const set& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template ostream& operator<<(ostream& os, const multiset& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template ostream& operator<<(ostream& os, const unordered_set& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template ostream& operator<<(ostream& os, const deque& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? "" : " "); } return os; } void debug_out() { cerr << '\n'; } template void debug_out(Head&& head, Tail&&... tail) { cerr << head; if (sizeof...(Tail) > 0) cerr << ", "; debug_out(move(tail)...); } #ifdef LOCAL #define debug(...) \ cerr << " "; \ cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \ cerr << " "; \ debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif template T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; } template T lcm(T x, T y) { return x / gcd(x, y) * y; } template inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; } #pragma endregion const int INF = 1e9; const long long IINF = 1e18; const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; const char dir[4] = {'D', 'R', 'U', 'L'}; const long long MOD = 1000000007; // const long long MOD = 998244353; const int MAX_N = 55; int N, K, op = 0; int A[MAX_N]; vector S; vector x, y, z; void UPD(int i, int j) { op++; S.emplace_back("UPD"); x.emplace_back(i); y.emplace_back(j); z.emplace_back(0); } void AND(int i, int j, int k) { op++; S.emplace_back("AND"); x.emplace_back(i); y.emplace_back(j); z.emplace_back(k); } void XOR(int i, int j, int k) { op++; S.emplace_back("XOR"); x.emplace_back(i); y.emplace_back(j); z.emplace_back(k); } void solve() { for (int j = N - 1; j > 0; j--) { for (int i = j - 1; i >= 0; i--) { // A[i] と A[i + 1] を昇順ソートする XOR(N, N, i); // A[N] = A[i] AND(i, i + 1, N); // A[i] = A[i] & A[i + 1] XOR(N, N, i + 1); // A[N] = A[i] ^ A[i + 1] XOR(i, i, N); // A[i] = (A[i] & A[i + 1]) ^ (A[i] ^ A[i + 1]) = A[i] | A[i + 1] XOR(N, N, i + 1); // A[N] = A[i] AND(i + 1, N, i + 1); // A[i + 1] = A[i] & A[i + 1] XOR(N, N, N); // A[N] = 0 } } XOR(N, N, K - 1); } bool check() { int one = 0; for (int i = 0; i < N; i++) cin >> A[i], one += A[i]; A[N] = 0; // for (int i = 0; i <= N; i++) cout << A[i]; // cout << '\n'; for (int i = 0; i < op; i++) { if (S[i] == "UPD") { A[x[i]] = y[i]; } else if (S[i] == "AND") { A[x[i]] = A[y[i]] & A[z[i]]; } else { A[x[i]] = A[y[i]] ^ A[z[i]]; } } // for (int i = 0; i <= N; i++) cout << A[i]; // cout << '\n'; return A[N] == (one >= K); } int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> N >> K; solve(); int T; cin >> T; for (; T--;) assert(check()); for (int i = 0; i < op; i++) { cout << S[i] << ' ' << x[i] << ' ' << y[i]; if (S[i] != "UPD") cout << ' ' << z[i]; cout << '\n'; } return 0; }