// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
// #define debug
int n, m, q, c;
typedef std::vector<std::vector<int>> string;
string &operator+=(string &A, const string &B)
{
    A.insert(A.end(), B.begin(), B.end());
    return A;
}
string &operator+=(string &A, const std::vector<int> &B)
{
    A.push_back(B);
    return A;
}
string f(std::vector<int> A, std::vector<int> B, int C)
{
    if (A.size() == 1)
        return {{2, A[0], C}};
    if (A.size() == 2)
        return {{3, A[0], A[1], C}};
    int ta = A.back(), tb = B.back();
    A.pop_back();
    B.pop_back();
    string res;
    res += {1, ta};
    res += {3, ta, tb, C};
    res += {1, ta};
    res += f(A, B, tb);
    res += {3, ta, tb, C};
    return res;
}
string work(std::vector<int> A, std::vector<int> B, int C)
{
    string res = f(A, B, C);
    for (int i = res.size(); i--;)
        if (res[i].back() != C)
            res.push_back(res[i]);
    return res;
}
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> n >> m >> q >> c;
    std::vector<int> a(n >> 1), b((n + 1) >> 1);
    std::iota(a.begin(), a.end(), 0);
    std::iota(b.begin(), b.end(), a.size());
    string ans;
    b.push_back(n + 1);
    ans += work(b, a, n);
    b.pop_back();
    ans += work(a, b, n + 1);
    b.push_back(n + 1);
    ans += work(b, a, n);
    b.pop_back();
    ans += work(a, b, n + 1);
    std::cout << ans.size() << std::endl;
    for (auto i : ans)
        for (std::size_t j = 0; j != i.size(); ++j)
            std::cout << i[j] << " \n"[j + 1 == i.size()];
    return 0;
}