#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
    int n, k;
    cin>>n>>k;
    int c=2;
    for(int i=1; i<n; i++){
        for(int j=i-1; j>=0; j--){
            c+=5;
        }
    }
    cout<<c<<endl;
    for(int i=1; i<n; i++){
        for(int j=i-1; j>=0; j--){
            cout<<"UPD "<<n<<" "<<0<<endl;
            cout<<"XOR "<<n<<" "<<j<<" "<<j+1<<endl;
            cout<<"AND "<<n<<" "<<n<<" "<<i<<endl;
            cout<<"XOR "<<j<<" "<<j+1<<" "<<n<<endl;
            cout<<"XOR "<<j+1<<" "<<j<<" "<<n<<endl;
        }
    }
    cout<<"UPD "<<n<<" "<<0<<endl;
    cout<<"XOR "<<n<<" "<<n<<" "<<k-1<<endl;
    return 0;
}