#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, k; cin >> n >> k;
  cout << n * (n - 1) / 2 * 7 + 1 << '\n';
  for (int i = n - 1; i >= 0; --i) REP(j, i) {
    cout << "AND " << n << ' ' << j << ' ' << j + 1 << '\n';
    cout << "XOR " << j << ' ' << j << ' ' << n << '\n';
    cout << "XOR " << j + 1 << ' ' << j + 1 << ' ' << n << '\n';
    cout << "XOR " << n << ' ' << j << ' ' << n << '\n';
    cout << "XOR " << j << ' ' << j << ' ' << n << '\n';
    cout << "XOR " << j + 1 << ' ' << j + 1 << ' ' << n << '\n';
    cout << "UPD " << n << ' ' << 0 << '\n';
  }
  cout << "XOR " << n << ' ' << n - k << ' ' << n << '\n';
  return 0;
}