#include <fstream>
#include <unordered_map>
#include <string>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int n,aux, s, v[101];
unordered_map<int, int> umap;
int main(){
    fin>>n>>s;
    for(int i=1;i<=n;i++)
        fin>>v[i];
    for(int i=1;i<=n;i++){
        for(int j=i;j<=n;j++){
            for(int k=j;k<=n;k++){
                aux=v[i]+v[j]+v[k];
                umap[aux]=k+j*1000+i*1000000;
                if(umap[s-aux]!=0){
                    fout<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[umap[s-aux]%1000]<<" "<<v[umap[s-aux]/1000%1000]<<" "<<v[umap[s-aux]/1000000];
                    return 0;
                    
                }
            } 
        }
    }
    fout<<-1;
    return 0;
}