#include <bits/stdc++.h>   using namespace std;   long long a[100];   long long b[100];   vector<long long> pos[101];   int main() {     long long i, j, k, l, m, n, t;     scanf( %lld , &n);     scanf( %lld , &k);     for (i = 0; i < n; i++) {       scanf( %lld , &a[i]);       pos[a[i]].push_back(i);     }     long long sum = 0, count = 0;     long long flag = 0;     for (i = 1; i <= 100; i++) {       for (j = 0; j < pos[i].size(); j++) {         sum = sum + a[pos[i][j]];         if (sum > k) {           flag = 1;           break;         }         b[count++] = pos[i][j];       }       if (flag == 1) break;     }     cout << count << endl;     for (j = 0; j < count; j++) cout << b[j] + 1 <<    ;     return 0;   }   