#include <bits/stdc++.h>
using namespace std;
int main() {
  std::ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int n, k;
  cin >> n >> k;
  long long int cost = 0, ans = 0, a[n];
  vector<pair<long long int, long long int>> pr(n);
  for (long long int(i) = 0; (i) < (n); (i)++) {
    long long int a;
    cin >> a;
    pr[i] = make_pair(a, i + 1);
  }
  sort(pr.begin(), pr.end());
  vector<long long int> v;
  for (long long int(i) = 0; (i) < (n); (i)++) {
    if ((cost > k) || (cost + pr[i].first > k))
      break;
    else {
      cost += pr[i].first;
      ans++;
      v.push_back(pr[i].second);
    }
  }
  cout << ans << "\n";
  sort(v.begin(), v.end());
  for (long long int(i) = 0; (i) < (ans); (i)++) {
    cout << v[i] << " ";
  }
  cout << "\n";
  return 0;
}
