#include<bits/stdc++.h>

#define LL long long

#define fi first

#define se second

#define mk make_pair

#define PLL pair<LL, LL>

#define PLI pair<LL, int>

#define PII pair<int, int>

#define SZ(x) ((int)x.size())

#define ull unsigned long long

using namespace std;

const int N =  + ;

const int inf = 0x3f3f3f3f;

const LL INF = 0x3f3f3f3f3f3f3f3f;

const int mod = 1e9 + ;

const double eps = 1e-;

int n, s;

PII a[N];

bitset<> dp[N/];

bitset<> dp2;

bitset<> tmp;

vector<int> edge[N];

vector<PII> dol;

int c[N];

bool in[N];

bool ok(int x, int y) {

    if(y < ) return false;

    dp2 = dp[x/];

    for(int i = x/*+; i <= x; i++)

        dp2 |= (dp2 << a[i].fi);

    return dp2[y];

}

int main() {

    scanf("%d%d", &n, &s);

    for(int i = ; i <= n; i++) {

        scanf("%d", &a[i].fi);

        a[i].se = i;

    }

    sort(a+, a++n);

    int tar = s - a[n].fi;

    tmp[] = ; dp[] = tmp;

    for(int i = ; i < n; i++) {

        tmp |= (tmp<<a[i].fi);

        if(i %  == ) dp[i/] = tmp;

    }

    if(ok(n-, tar)) {

        for(int i = n-, now = tar; i >= ; i--) {

            if(now >= a[i].fi && ok(i-, now-a[i].fi)) {

                now = now - a[i].fi;

                in[a[i].se] = true;

            }

        }

        for(int i = ; i < n; i++) {

            if(in[a[i].se]) {

                c[a[i].se] = a[i].fi;

            } else {

                dol.push_back(a[i]);

            }

        }

        dol.push_back(a[n]);

        for(int i = ; i < dol.size(); i++) {

            if(i) {

                c[dol[i].se] = dol[i].fi - dol[i-].fi;

                edge[dol[i].se].push_back(dol[i-].se);

            } else {

                c[dol[i].se] = dol[i].fi;

            }

        }

        for(int i = ; i <= n; i++) {

            printf("%d %d ", c[i], edge[i].size());

            for(int j : edge[i]) printf("%d ", j);

            puts("");

        }

    } else {

        puts("-1");

    }

    return ;

}

/*

*/