#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> k, c;
bool comp(pair<int, int> a, pair<int, int> b) { return a.first > b.first; }
int res = 0;
pair<int, int> ind;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, v;
  cin >> n >> v;
  for (int i = 0; i < n; i++) {
    int a, b;
    cin >> a >> b;
    if (a == 1)
      k.push_back({b, i + 1});
    else
      c.push_back({b, i + 1});
  }
  sort(k.begin(), k.end(), comp);
  sort(c.begin(), c.end(), comp);
  int sum = 0;
  for (auto i : c) sum += i.first;
  int p = 0, sum1 = 0;
  for (int i = c.size(); i >= 0; i--) {
    if (i * 2 > v) {
      sum -= c[i - 1].first;
      continue;
    }
    while (p + 2 * i < v && p < k.size()) p++, sum1 += k[p - 1].first;
    if (res < sum1 + sum) res = sum1 + sum, ind = {i, p};
    if (i - 1 >= 0) sum -= c[i - 1].first;
  }
  cout << res << endl;
  for (int i = 0; i < ind.first; i++) cout << c[i].second << " ";
  for (int i = 0; i < ind.second; i++) cout << k[i].second << " ";
}
