#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(int t) {
  for (int p = 0; p < 1 << (t ? M : (N + 1)); ++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: r ^= (r >> op.x & 1) << op.y; break;
          case 3: r ^= (r >> op.x & r >> op.y & 1) << op.z; break;
          default: assert(false);
        }
      }
      for (int i = 0; i < M; ++i) cerr << (r >> i & 1);
      cerr << endl;
    }
    assert(q == r);
  }
}

/*
  n=1
    a0 b0
       b0+a0
  
  n=2
    a0 a1 b0    b1
                b1+a1b0
          b0+a0
                b1+a0a1
          b0
  
  n=2 another
    a0 a1 b0    b1
          b0+a0
                b1+a0a1+a1b0
          b0
                b1+a0a1
  
  n=3
    a0 a1 a2 b0    b1      b2
                           b2+a2b1
                   b1+a1b0
             b0+a0
                   b1+a0a1
             b0
                           b2+a0a1a2
             b0+a0
                   b1+a1b0
             b0
                   b1
  ->
    a0 a1 a2 b0    b1      b2
                           b2+a2b1
                   b1+a1b0
             b0+a0
                   b1+a0a1
                           b2+a0a1a2
                   b1+a1b0
             b0
                   b1
  
  n=3 another
    a0 a1 a2 b0    b1      b2
                   b1+a1b0
             b0+a0
                   b1+a0a1
                           b2+a0a1a2+a2b1
                   b1+a1b0
             b0
                   b1
                           b2+a0a1a2
  
  n=4
    a0 a1 a2 a3 b0    b1      b2        b3
                                        b3+a3b2
                              b2+a2b1
                      b1+a1b0
                b0+a0
                      b1+a0a1
                              b2+a0a1a2
                      b1+a1b0
                b0
                      b1
                                        b3+a0a1a2a3
                      b1+a1b0
                b0+a0
                      b1+a0a1
                              b2+a2b1
                      b1+a1b0
                b0
                      b1
                              b2
  ->
    a0 a1 a2 a3 b0    b1      b2        b3
                                        b3+a3b2
                              b2+a2b1
                      b1+a1b0
                b0+a0
                      b1+a0a1
                              b2+a0a1a2
                                        b3+a0a1a2a3
                              b2+a2b1
                      b1+a1b0
                b0
                      b1
                              b2
*/

// tar += \prod as
void solve(const vector<int> &as, const vector<int> &bs, int tar) {
  const int n = as.size();
  if (n == 0) {
    oper(tar);
  } else if (n == 1) {
    oper(as[0], tar);
  } else if ((int)bs.size() >= n - 1) {
    for (int h = 0; h < 2; ++h) {
      oper(as[n - 1], bs[n - 2], tar);
      for (int j = n - 1; --j >= 1; ) oper(as[j], bs[j - 1], bs[j]);
      oper(as[0], bs[0]);
      for (int j = 1; j < n - 1; ++j) oper(as[j], bs[j - 1], bs[j]);
    }
  } else {
    assert(bs.size() >= 1);
    const int half = (n + 1) / 2;
    for (int h = 0; h < 2; ++h) {
      {
        vector<int> aas, bbs;
        for (int i = 0; i < half; ++i) aas.push_back(as[i]);
        for (int i = half; i < n; ++i) bbs.push_back(as[i]);
        bbs.push_back(tar);
        solve(aas, bbs, bs[0]);
      }
      {
        vector<int> aas, bbs;
        for (int i = half; i < n; ++i) aas.push_back(as[i]);
        aas.push_back(bs[0]);
        for (int i = 0; i < half; ++i) bbs.push_back(as[i]);
        solve(aas, bbs, tar);
      }
    }
  }
}

int main() {
  for (; ~scanf("%d%d%d%d", &N, &M, &Q, &C); ) {
    ops.clear();
    vector<int> as, bs;
    for (int u = 0; u < N; ++u) as.push_back(u);
    for (int u = N + 1; u < M; ++u) bs.push_back(u);
    solve(as, bs, 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(1);
#endif
  }
  return 0;
}