#include <bits/stdc++.h>   using namespace std;   pair<int, int> a[100000];   int main() {     int n, k;     cin >> n >> k;     for (int i = 0; i < n; i++) {       int go;       cin >> go;       a[i].first = go;       a[i].second = i;     }     sort(a, a + n);     int an = 0;     for (int i = 0; i < n; i++) {       k -= a[i].first;       if (k < 0) break;       an++;     }     cout << an << endl;     for (int i = 0; i < an; i++) {       cout << a[i].second + 1 <<    ;     }     cout << endl;     return 0;   }   