Amr is a young coder who likes music a lot. He always wanted to learn how to play music but he was busy coding so he got an idea.

Amr has n instruments, it takes ai days to learn i-th instrument. Being busy, Amr dedicated k days to learn how to play the maximum possible number of instruments.

Amr asked for your help to distribute his free days between instruments so that he can achieve his goal.

Input

The first line contains two numbers n, k (1 ≤ n ≤ 100, 0 ≤ k ≤ 10 000), the number of instruments and number of days respectively.

The second line contains n integers ai (1 ≤ ai ≤ 100), representing number of days required to learn the i-th instrument.

Output

In the first line output one integer m representing the maximum number of instruments Amr can learn.

In the second line output m space-separated integers: the indices of instruments to be learnt. You may output indices in any order.

if there are multiple optimal solutions output any. It is not necessary to use all days for studying.

Examples

Input

4 10
4 3 1 2


Output

4
1 2 3 4

Input

5 6
4 3 1 1 2


Output

3
1 3 4

Input

1 3
4


Output

0

Note

In the first test Amr can learn all 4 instruments.

In the second test other possible solutions are: {2, 3, 5} or {3, 4, 5}.

In the third test Amr doesn't have enough time to learn the only presented instrument.
//507A : AMR AND MUSIC

/*
 * Solution: 
 */

/*
 * Prerequisite:
 * 	- Comparable Interface
 * 	- Sorting
 */
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;

//Your code goes here
public class Main {	
	
	static class ProblemSolver{
		/*
		 * Most necessary data structure storing them in
		 * pairs of days and indices and also having the
		 * capability of sorting them in terms of days
		 */
		class Pair implements Comparable<Pair>{
			int days;
			int index;
			public Pair(int days,int index) {
				this.days=days;
				this.index=index;
			}
			public int compareTo(Pair o) {
				return Integer.compare(this.days, o.days);
			}	
			
		}
		public void solveTheProblem(InputReader in,PrintWriter out){
			//Take necessary inputs
			int n=in.nextInt();
			int total=in.nextInt();
			ArrayList<Pair> pairs=new ArrayList<>();
			for(int index=1;index<=n;++index){
				int days=in.nextInt();
				pairs.add(new Pair(days, index));
			}
			
			//Sort the necessary inputs in terms of days
			Collections.sort(pairs);
			
			//Save the number of indices in another list and
			//count the number of days simultaneously
			ArrayList<Integer> instrument=new ArrayList<>();
			int counter=0;
			for(Pair p:pairs){
				if(p.days<=total){
					instrument.add(p.index);
					total-=p.days;
					++counter;
				}else break;				
			}
			
			//Display the result
			out.println(counter);
			for(int i:instrument)out.print(i+" ");
		}					
	}
	
	//Default template for all the codes
	static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream),32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
	
	//Main method for all the codes
	public static void main(String[] args) {
		InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
		ProblemSolver problemSolver = new ProblemSolver();
		problemSolver.solveTheProblem(in, out);		
		out.close();		
	}

}