#include <bits/stdc++.h>
using namespace std;
pair<int, int> a[110];
int n, k;
vector<int> ans;
void solve() {
  cin >> n >> k;
  for (int i = (1); i <= (n); ++i) {
    int x;
    cin >> x;
    a[i].first = x;
    a[i].second = i;
  }
  sort(a + 1, a + 1 + n);
  int s = 0;
  for (int i = 1; i <= n; ++i) {
    s += a[i].first;
    if (s <= k)
      ans.push_back(a[i].second);
    else
      break;
  }
  sort(ans.begin(), ans.end());
  cout << ans.size() << endl;
  {
    for (int i = (0); i < (ans.size()); ++i) cout << ans[i] << " ";
    cout << endl;
  };
}
int main() {
  solve();
  return 0;
}
