#include <cstdio>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

#define TRACE(x) cerr << #x << " = " << x << endl
#define REP(i, n) for (int i=0; i<n; i++)
#define FOR(i, a, b) for (int i=(a); i<(b); i++)

typedef long long ll;
typedef pair<int, int> P;
#define X first
#define Y second

const int MAX = 1<<17;

ll gauss(int x)
{
  return (ll) x * (x + 1) / 2;
}

ll povrh2(int x)
{
  return (ll) x * (x - 1) / 2;
}

int tree, bck, fwd, crss;
int n;
int vel;
int v1;
int v2;
int vecih;
int manjih;
int gor, dol;
vector <int> V[MAX];

void add(int a, int b)
{
  //  printf("ADD %d %d\n", a, b);
  V[a].push_back(b);
}

void ajmo(int kol)
{
  int poz = 2;
  int treba_bck = bck;
  int treba_fwd = fwd;
  int treba_crss = crss;
  vector <vector<int> > Gr;

  ll gd = n - 1, preko = 0;

  for (int i=0; i<kol; i++) {
    int t_vel = v1;
    if (i >= manjih) t_vel = v2;

    vector <int> T{1, poz};
    add(1, poz);

    poz++;
    for (int j=0; j<t_vel-2; j++, poz++) {
      T.push_back(poz);
      add(poz-1, poz);
    }

    for (int j=0; j<(int) T.size(); j++) {
      if (j + 1 < (int) T.size()) {
        gd++;
        if (treba_bck) {
          add(T[j+1], T[j]);
          treba_bck--;
        }
      }

      for (int k=j+2; k<(int) T.size(); k++) {
        if (treba_bck) {
          add(T[k], T[j]);
          treba_bck--;
          gd++;
        }
        if (treba_fwd) {
          add(T[j], T[k]);
          treba_fwd--;
          gd++;
        }
        if (!treba_bck && !treba_fwd) break;
      }

      if (!treba_bck && !treba_fwd) break;
    }

    T.erase(T.begin());
    Gr.push_back(T);
  }

  for (int i=0; i<(int) Gr.size(); i++) {
    for (int j=0; j<i; j++) {
      for (auto it : Gr[i]) {
        for (auto it2 : Gr[j]) {
          if (treba_crss) {
            add(it, it2);
            treba_crss--;
            preko++;
          }

          if (!treba_crss) break;
        }
        if (!treba_crss) break;
      }
      if (!treba_crss) break;
    }
    if (!treba_crss) break;
  }

  //printf("AJMO GD PREKO %lld %lld\n", gd, preko);

  /*  TRACE(treba_bck);
      TRACE(treba_fwd);
      TRACE(treba_crss);
      assert(!treba_bck && !treba_crss && !treba_fwd);*/

  printf("%d\n", n);
  FOR(i, 1, n+1) {
    printf("%d ", (int) V[i].size());
    for (auto it : V[i])
      printf("%d ", it);
    printf("\n");
  }
}

void ajmo2()
{
  int treba_bck = bck;
  int treba_fwd = fwd;
  int treba_crss = crss;

  FOR(i, 1, gor)
    add(i, i+1);

  FOR(i, gor+1, n+1)
    add(gor, i);

  FOR(i, 1, gor+1) {
    FOR(j, gor+1, n+1) {
      if (i != gor && treba_fwd) {
        add(i, j);
        treba_fwd--;
      }
      if (treba_bck) {
        add(j, i);
        treba_bck--;
      }
      if (!treba_bck && !treba_fwd) break;
    }

    if (!treba_bck && !treba_fwd) break;
  }

  FOR(i, 1, gor+1) {
    FOR(j, i+1, gor+1) {
      if (i + 1 != j && treba_fwd) {
        add(i, j);
        treba_fwd--;
      }
      if (treba_bck) {
        add(j, i);
        treba_bck--;
      }

      if (!treba_bck && !treba_fwd) break;
    }

    if (!treba_bck && !treba_fwd) break;
  }

  FOR(i, gor+1, n+1) {
    FOR(j, i+1, n+1) {
      if (treba_crss) {
        add(j, i);
        break;
      }
      if (!treba_crss) break;
    }

    if (!treba_crss) break;
  }

  printf("%d\n", n);
  FOR(i, 1, n+1) {
    printf("%d ", (int) V[i].size());
    for (auto it : V[i])
      printf("%d ", it);
    printf("\n");
  }

}

int main()
{
  scanf("%d%d%d%d", &tree, &bck, &fwd, &crss);
  n = tree + 1;

  for (int i=1; i<=n-1; i++) { //broj grana
    int broji = n-1 + i;      

    vel = broji / i;
    v1 = vel;
    v2 = vel + 1;
    vecih = broji % i;
    manjih = i - vecih;

    ll preko = 0;
    preko += povrh2(manjih) * (v1 - 1) * (v1 - 1);
    preko += povrh2(vecih) * (v2 - 1) * (v2 - 1);
    preko += (ll) manjih * vecih * (v1 - 1) * (v2 - 1);

    ll gd = 2 * manjih * povrh2(v1);
    gd += 2 * vecih * povrh2(v2);

    if (preko >= crss && gd >= bck + fwd + tree && gd / 2 - tree >= fwd) {
      TRACE(i);
      TRACE(gd); TRACE(preko);
      ajmo(i);
      return 0;
    }
  }

  for (int i=1; i<=n; i++) {
    gor = i;
    dol = n - i;

    ll preko = povrh2(dol);
    ll gd = 2 * (ll) gor * dol;
    gd += 2 * povrh2(gor);

    if (preko >= crss && gd >= bck + fwd + tree && gd / 2 - tree >= fwd) {
      ajmo2();
      return 0;
    }
  }

  printf("-1\n");

  return 0;
}