#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;
using T = tuple<string, int, int, int>;
const string AND = "AND";
const string XOR = "XOR";
const string UPD = "UPD";

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, k; cin >> n >> k;
    vector<T> ans;
    auto add_swap = [&](int i, int j){
        ans.push_back(T(AND, n, i, j));
        ans.push_back(T(XOR, i, i, j));
        ans.push_back(T(XOR, i, i, n));
        ans.push_back(T(AND, j, j, n));
    };
    for(int i = n-1; i >= 1; i--){
        for(int j = i; j >= 1; j--){
            add_swap(j-1, j);
        }
    }
    ans.push_back(T(UPD, n, 0, 0));
    ans.push_back(T(XOR, n, n, k-1));
    int t; cin >> t;
    while(t--){
        vector<int> c(n+1);
        for(int i = 0; i < n; i++) cin >> c[i];
        int sum = accumulate(c.begin(), c.end(), 0);
        for(auto [t, x, y, z]: ans){
            if(t == XOR) c[x] = c[y]^c[z];
            if(t == AND) c[x] = c[y]&c[z];
            if(t == UPD) c[x] = y;
        }
        if(sum >= k) assert(c[n] == 1);
        else assert(c[n] == 0);
    }
    cout << ans.size() << endl;
    for(auto [t, a, b, c]: ans){
        if(t == UPD) cout << t << ' ' << a << ' ' << b << endl;
        else cout << t << ' ' << a << ' ' << b << ' ' << c << endl; 
    }
}