#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int N;

void solve(int i, int j){
    cout << "UPD " << N << ' ' << 1 << '\n';
    cout << "XOR " << N << ' ' << i << ' ' << N << ' ' << '\n';
    cout << "AND " << N << ' ' << j << ' ' << N << ' ' << '\n';
    cout << "XOR " << j << ' ' << i << ' ' << j << ' ' << '\n';
    cout << "XOR " << i << ' ' << i << ' ' << j << ' ' << '\n';
    cout << "XOR " << j << ' ' << i << ' ' << j << ' ' << '\n';
    cout << "XOR " << i << ' ' << i << ' ' << N << ' ' << '\n';
    cout << "XOR " << j << ' ' << j << ' ' << N << ' ' << '\n';
}

int main(){
    int K; cin >> N >> K;

    int T; cin >> T;

    vector<vector<int>> c(T, vector<int>(N));

    rep(i, T){
        rep(j, N){
            cin >> c[i][j];
        }
    }

    cout << 4*N*(N-1)+2 << '\n';

    rep(j, N){
        rep(i, j){
            solve(i, j);
        }
    }

    cout << "UPD " << N << ' ' << 1 << '\n';
    cout << "AND " << N << ' ' << N-K << ' ' << N << '\n';
}