#include <bits/stdc++.h>
using namespace std;
struct node {
  int val, pos;
};
vector<node> kaya, cata;
bool cmp(node a, node b) { return a.val > b.val; }
int main() {
  ios::sync_with_stdio(false);
  int n, v, ans = 0;
  cin >> n >> v;
  for (int i = 1; i <= n; i++) {
    int type, val;
    cin >> type >> val;
    node temp;
    temp.val = val;
    temp.pos = i;
    if (type == 1)
      kaya.push_back(temp);
    else
      cata.push_back(temp);
  }
  int lenk = kaya.size();
  int lenc = cata.size();
  sort(kaya.begin(), kaya.end(), cmp);
  sort(cata.begin(), cata.end(), cmp);
  if (v == 1) {
    if (lenk) {
      cout << kaya[0].val << endl << kaya[0].pos << endl;
    } else {
      cout << 0 << endl << endl;
    }
    return 0;
  }
  int indexk, indexc;
  for (indexc = 0; indexc < lenc; indexc++) {
    if (v >= 2) {
      v -= 2;
      ans += cata[indexc].val;
    }
    if (v < 2) break;
  }
  if (indexc == lenc) indexc = lenc - 1;
  for (indexk = 0; indexk < lenk; indexk++) {
    if (v == 0) break;
    v--;
    ans += kaya[indexk].val;
  }
  for (; indexk < lenk; indexk += 2) {
    if (indexc < 0) break;
    if (indexk < lenk - 1) {
      if (kaya[indexk].val + kaya[indexk + 1].val > cata[indexc].val) {
        ans += kaya[indexk].val + kaya[indexk + 1].val - cata[indexc].val;
        indexc--;
      } else
        break;
    } else {
      if (kaya[indexk].val > cata[indexc].val) {
        ans += kaya[indexk].val - cata[indexc].val;
        indexc--;
      } else
        break;
    }
  }
  if (indexk == lenk + 1) indexk = lenk;
  cout << ans << endl;
  vector<int> res;
  for (int i = 0; i < indexk; i++) res.push_back(kaya[i].pos);
  for (int i = 0; i <= indexc; i++) res.push_back(cata[i].pos);
  cout << res[0];
  int s = res.size();
  for (int i = 1; i < s; i++) {
    cout << " " << res[i];
  }
  cout << endl;
  return 0;
}
