#include <bits/stdc++.h>
using namespace std;
typedef int ll;
inline ll read()
{ll s=0;bool f=0;char ch=' ';while(!isdigit(ch)){f|=(ch=='-'); ch=getchar();}while(isdigit(ch)){s=(s<<3)+(s<<1)+(ch^48); ch=getchar();}return (f)?(-s):(s);
}
#define R(x) x=read()
inline void write(ll x)
{if(x<0){putchar('-'); x=-x;}if(x<10){putchar(x+'0'); return;}write(x/10);putchar((x%10)+'0');return;
}
#define W(x) write(x),putchar(' ')
#define Wl(x) write(x),putchar('\n')
const int N=100005;
int n,A,B,C,D,X,Y,Id[N],Top,Father[N],Lower[N];
//树边个数为A，返祖边个数为B，前向边个数为C，横叉边个数为D
vector<int>E[N],Ans[N];
inline void Link(int u,int v)
{E[u].push_back(v); Ans[u].push_back(v);
}
inline void dfs(int u)
{int i,j;for(i=1;i<=E[u].size();i++){int v=E[u][i-1];Father[v]=u;if(C){for(j=Father[u];j&&C;j=Father[j]){Ans[j].push_back(v); C--; if(!C) break;}}if(B){for(j=u;j&&B;j=Father[j]){Ans[v].push_back(j); B--; if(!B) break;}}if(D){for(j=1;j<=*Lower;j++){Ans[v].push_back(Lower[j]); D--; if(!D) break;}}dfs(v);}Lower[++*Lower]=u;
}
int main()
{freopen("dfs.in","r",stdin);freopen("dfs.out","w",stdout);int i,j,Sum;R(A); R(B); R(C); R(D);Sum=X=max(B,A+C); Y=D; n=A+1;if((long long)(1LL*n*(n-1)/2)<(long long)(X+Y)) return puts("-1"),0;Id[Top=0]=1;for(i=2;i<=n;i++){if(Sum>=Top+1+n-i){Link(Id[Top++],i); Sum-=Top; Id[Top]=i;}else{int tmp=Sum-(n-i); Link(Id[tmp-1],i); Sum-=tmp;}}dfs(1);Wl(n);for(i=1;i<=n;i++){W((int)Ans[i].size());for(j=1;j<=Ans[i].size();j++) W(Ans[i][j-1]);putchar('\n');}return 0;
}
/*
input
3 1 1 1
output
4
3 2 4 3
1 3
1 1
1 2
*/