#include<cstdio>
#include<algorithm>

using namespace std;

int n,S,ct;

int cautbin(int val){

    int step=(1<<31), start=1;

    for(; step; step>>=1){

        if(index>n)continue;
        if(v[index]<=val)start=index;
    }

    return start;
}

int main(){

    freopen("loto.in", "r", stdin);
    freopen("loto.out", "w", stdout);

    scanf("%d %d", n, S);

    int v[n+1];

    for(int i=1;i<=n;++i)scanf("%d", v[i]);

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

            for(int x=1;x<=n;++x){
                v[ct].sum=i+j+x;
                v[ct].x=i;
                v[ct].y=j;
                v[ct].z=x;

                ++ct;
        }
    }

    sort(v+1;v+ct+1);

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

            for(int x=1;x<=n;++x){

                int suma=i+j+k;
                int aux=S-suma;

                int ofya=cautbin(aux);

                if(ofya==aux){

                    printf("%d %d %d %d %d %d", i, j, x, v[ct].x, v[ct].y, v[ct].z);
                    break;
                }
        }
    }
}