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.

import java.io.PrintWriter;

import java.util.*;
import java.util.Arrays ; 

 
import java.io.DataInputStream; 
import java.io.FileInputStream; 
import java.io.IOException; 


public class Test{
static class Reader 
    { 
        final private int BUFFER_SIZE = 1 << 16; 
        private DataInputStream din; 
        private byte[] buffer; 
        private int bufferPointer, bytesRead; 
  
        public Reader() 
        { 
            din = new DataInputStream(System.in); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public Reader(String file_name) throws IOException 
        { 
            din = new DataInputStream(new FileInputStream(file_name)); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public String readLine() throws IOException 
        { 
            byte[] buf = new byte[64]; // line length 
            int cnt = 0, c; 
            while ((c = read()) != -1) 
            { 
                if (c == '\n') 
                    break; 
                buf[cnt++] = (byte) c; 
            } 
            return new String(buf, 0, cnt); 
        } 
  
        public int nextInt() throws IOException 
        { 
            int ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do
            { 
                ret = ret * 10 + c - '0'; 
            }  while ((c = read()) >= '0' && c <= '9'); 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public long nextLong() throws IOException 
        { 
            long ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public double nextDouble() throws IOException 
        { 
            double ret = 0, div = 1; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
  
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
  
            if (c == '.') 
            { 
                while ((c = read()) >= '0' && c <= '9') 
                { 
                    ret += (c - '0') / (div *= 10); 
                } 
            } 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        private void fillBuffer() throws IOException 
        { 
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
            if (bytesRead == -1) 
                buffer[0] = -1; 
        } 
  
        private byte read() throws IOException 
        { 
            if (bufferPointer == bytesRead) 
                fillBuffer(); 
            return buffer[bufferPointer++]; 
        } 
  
        public void close() throws IOException 
        { 
            if (din == null) 
                return; 
            din.close(); 
        } 
    } 
   

static int find(int x[],int temp,LinkedList l2){
    for (int i = 0; i < x.length; i++) {
       
           if(x[i]==temp&&!l2.contains(i)) {
               l2.add(i) ;
               return i ;
           }  
        
   
    }
    return -1 ; 
}
static int find2(int x[][],int temp){
    for (int i = 0; i < x.length; i++) {
        for (int j = 0; j < x[0].length; j++) {
           if(x[i][j]==temp) return j ;  
        }
   
    }
    return -1 ; 
}


    public static void main(String[] args) throws IOException  {

    
        PrintWriter pw = new PrintWriter(System.out);   
     // Reader  in =new Reader ();
      Scanner  in =new Scanner (System.in);
      int n =in.nextInt() ; 
      int k=in.nextInt() ; 
      int x[]=new int[n] ; 
      int y[]=new int[n] ; 
        for (int i = 0; i <n; i++) {
               x[i]=in.nextInt() ; 
               y[i]=x[i] ; 
        }
         
            
       Arrays.sort(x);
       int j= 0 ; 
       LinkedList l1 =new LinkedList() ;
     int   sum=0 ; 
       while(true){
         if(sum>k){
             l1.removeLast() ;
             break ; 
         } 
         if(j==x.length)break ;
         sum+=x[j] ;
         l1.add(x[j]) ;
         j++ ;
         
       }
        pw.println(l1.size());
        LinkedList l2 =new LinkedList() ;
        int o [] =new int[l1.size()] ;
        for (int i = 0; i < l1.size(); i++) {
           o[i]=find(y, (int)l1.get(i),l2)+1;
        }
        for (int i = 0; i < o.length; i++) {
            pw.print(o[i]+" ");
        }
        
      pw.close();   
            
             
        
      
}
static class pair{
   public  int val , key ; 
    pair(int val , int key){
        this.val= val ; 
        this .key = key   ; 
    }
}
}