using System;
using System.IO;
using System.Linq;
using System.Text;
using System.Diagnostics;
using System.Collections.Generic;
using System.Text.RegularExpressions;
using Enu = System.Linq.Enumerable;

class Program
{
    void Solve()
    {
        int N = reader.Int(), S = reader.Int();
        var P = reader.IntArray(N);
        int NumA = N / 2, NumB = N - NumA;
        int[] sumA = new int[1 << NumA];

        for (int mask = 0; mask < (1 << NumA); mask++)
            for (int i = 0; i < NumA; i++)
                if ((mask >> i & 1) == 1)
                    sumA[mask] += P[i];
        int[] sumB = new int[1 << NumB];
        int[] maskB = new int[1 << NumB];
        for (int mask = 0; mask < (1 << NumB); mask++)
        {
            maskB[mask] = mask;
            for (int i = 0; i < NumB; i++)
                if ((mask >> i & 1) == 1)
                    sumB[mask] += P[NumA + i];
        }
        Array.Sort(sumB, maskB);
        var ans = new List<string>();
        for (int maskA = 0; maskA < (1 << NumA); maskA++)
        {
            if (sumA[maskA] > S) continue;
            int bi = LowerBound(sumB, S - sumA[maskA]);
            for (; bi < sumB.Length && sumA[maskA] + sumB[bi] == S; bi++)
            {
                int mask = maskA + (maskB[bi] << NumA);
                var curr = Enu.Range(0, N).Where(i => (mask >> i & 1) == 1).Select(i => (i + 1).ToString().PadLeft(2, char.MinValue));
                ans.Add(string.Join(" ", curr));
            }
        }
        ans.Sort();
        ans.ForEach(s => Console.WriteLine(s.Replace(char.MinValue + "", "")));
    }

    static int LowerBound<T>(T[] a, T val)
    {
        var comp = Comparer<T>.Default;
        int left = -1, right = a.Length;
        while (right - left > 1)
        {
            int mid = (left + right) / 2;
            if (comp.Compare(a[mid], val) >= 0) { right = mid; }
            else { left = mid; }
        }
        return right;
    }



    Reader reader = new Reader(Console.In);
    static void Main() { new Program().Solve(); }
}

class Reader
{
    private readonly TextReader reader;
    private readonly char[] separator = { ' ' };
    private readonly StringSplitOptions removeOp = StringSplitOptions.RemoveEmptyEntries;
    private string[] A = new string[0];
    private int i;

    public Reader(TextReader r) { reader = r; }
    public bool HasNext() { return Enqueue(); }
    public string String() { return Dequeue(); }
    public int Int() { return int.Parse(Dequeue()); }
    public long Long() { return long.Parse(Dequeue()); }
    public double Double() { return double.Parse(Dequeue()); }
    public int[] IntLine() { var s = Line(); return s == "" ? new int[0] : Array.ConvertAll(Split(s), int.Parse); }
    public int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); }
    public int[][] IntGrid(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); }
    public string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); }
    public string Line() { return reader.ReadLine().Trim(); }
    private string[] Split(string s) { return s.Split(separator, removeOp); }
    private bool Enqueue()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return Enqueue();
        A = Split(line);
        i = 0;
        return true;
    }
    private string Dequeue() { Enqueue(); return A[i++]; }
}