#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


struct Op {
  int t, x, y, z;
  friend ostream &operator<<(ostream &os, const Op &op) {
    return os << "(" << op.t << "; " << op.x << "," << op.y << "," << op.z << ")";
  }
};

int N, M, Q, C;

vector<Op> ops;
void oper(int x) {
  assert(0 <= x); assert(x < M);
  ops.push_back(Op{1, x, -1, -1});
}
void oper(int x, int y) {
  assert(0 <= x); assert(x < M);
  assert(0 <= y); assert(y < M);
  assert(x != y);
  ops.push_back(Op{2, x, y, -1});
}
void oper(int x, int y, int z) {
  assert(0 <= x); assert(x < M);
  assert(0 <= y); assert(y < M);
  assert(0 <= z); assert(z < M);
  assert(x != y); assert(x != z); assert(y != z);
  ops.push_back(Op{3, x, y, z});
}

void judge() {
  for (int p = 0; p < 1 << M; ++p) {
    int q = p, r = p;
    if (!(~q & ((1 << N) - 1))) q ^= 1 << N;
    for (const auto &op : ops) {
      switch (op.t) {
        case 1: r ^= 1 << op.x; break;
        case 2: if (r >> op.x & 1) r ^= 1 << op.y; break;
        case 3: if ((r >> op.x & 1) && (r >> op.y & 1)) r ^= 1 << op.z; break;
        default: assert(false);
      }
    }
    if (q != r) {
      cerr << "FAIL" << endl;
      r = p;
      for (const auto &op : ops) {
        for (int i = 0; i < M; ++i) cerr << (r >> i & 1);
        cerr << " " << op << endl;
        switch (op.t) {
          case 1: r ^= 1 << op.x; break;
          case 2: if (r >> op.x & 1) r ^= 1 << op.y; break;
          case 3: if ((r >> op.x & 1) && (r >> op.y & 1)) r ^= 1 << op.z; break;
          default: assert(false);
        }
      }
      for (int i = 0; i < M; ++i) cerr << (r >> i & 1);
      cerr << endl;
    }
    assert(q == r);
  }
}

int V;
map<pair<int, int>, int> cache;
void solve(int l, int r, int tar) {
  if (r - l == 0) {
    oper(tar);
  } else if (r - l == 1) {
    oper(l, tar);
  } else if (r - l == 2) {
    oper(l, l + 1, tar);
  } else {
    const int mid = (l + r) / 2;
    int vL, vR;
    auto it = cache.find(make_pair(l, r));
    if (it != cache.end()) {
      vL = it->second;
      vR = vL + 1;
    } else {
      vL = V++;
      vR = V++;
      cache[make_pair(l, r)] = vL;
    }
    oper(vL, vR, tar); solve(l, mid, vL);
    oper(vL, vR, tar); solve(mid, r, vR);
    oper(vL, vR, tar); solve(l, mid, vL);
    oper(vL, vR, tar); solve(mid, r, vR);
  }
}

int main() {
  for (; ~scanf("%d%d%d%d", &N, &M, &Q, &C); ) {
    ops.clear();
    V = N + 1;
    vector<int> us(N);
    for (int u = 0; u < N; ++u) {
      us[u] = u;
    }
    solve(0, N, N);
    
    printf("%d\n", (int)ops.size());
    for (const auto &op : ops) {
      switch (op.t) {
        case 1: printf("1 %d\n", op.x); break;
        case 2: printf("2 %d %d\n", op.x, op.y); break;
        case 3: printf("3 %d %d %d\n", op.x, op.y, op.z); break;
        default: assert(false);
      }
    }
    
#ifdef LOCAL
    judge();
#endif
  }
  return 0;
}