#include "testlib.h"
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
const int NMAX=2e5+5,maxval=1000000000;
int n[NMAX];
set<ll> freq;
bool add_new_element(ll Size){
    double p=(Size==0?1.0:1.0/cbrt(Size));
    return rnd.next(1000000)<=(p*1000000);
}
int main(int argc, char* argv[]){
    registerGen(argc,argv,1);
    int t=atoi(argv[1]+2),sumn=atoi(argv[2]+5),p0=atoi(argv[3]+3),bucket=atoi(argv[4]+7);
    for(int i=0;i<t;i++) n[i]++,sumn--;

    while(sumn>0) n[rnd.next(t)]++,sumn--;

    cout<<t<<'\n';


    for(int i=0;i<t;i++){
        cout<<n[i]<<'\n';
        ll current_prefix_sum=0;
        freq.clear(); freq.insert(0);

        for(int j=0;j<n[i];j++){
            if(!rnd.next(p0)){
                cout<<0<<" \n"[j==n[i]-1];
                freq.clear(); freq.insert(0);
                current_prefix_sum=0;
            }
            else{
                if(freq.size()<bucket && add_new_element(freq.size())){
                    ll curr=rnd.next(-maxval,maxval);
                    current_prefix_sum+=curr;
                    cout<<curr<<" \n"[j==n[i]-1];
                    freq.insert(current_prefix_sum); freq.insert(0);
                }
                else{
                    vector<ll> cnd;
                    for(auto it : freq){
                        if(abs(it-current_prefix_sum)<=maxval && it!=current_prefix_sum)
                            cnd.push_back(it);
                    }
                    ll new_prefix_sum=cnd[rnd.next(cnd.size())];
                    cout<<new_prefix_sum-current_prefix_sum<<" \n"[j==n[i]-1];
                    current_prefix_sum=new_prefix_sum;
                }
            }
        }
    }
    return 0;
}