#include <bits/stdc++.h>
using namespace std;
bool sieve[1000001];
void init() {
  long long i, j;
  sieve[0] = true;
  sieve[1] = true;
  for (i = 2; i < 1000001; i++) {
    if (!sieve[i]) {
      for (j = 2 * i; j < 1000001; j += i) sieve[j] = true;
    }
  }
}
long long power(long x, long n) {
  if (n == 0) return 1;
  if (n == 1) return x;
  long n2 = n / 2;
  long long po = power(x, n2);
  if (n % 2) return po * po * x;
  return po * po;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  a %= b;
  return gcd(b, a);
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
bool cmp(pair<long, long> &A, pair<long, long> &B) { return A.first > B.first; }
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0);
  long n, v, i, ans = 0, x, l1, l2;
  cin >> n >> v;
  vector<pair<long, long> > K, C;
  vector<long> A;
  for (i = 0; i < n; i++) {
    cin >> x;
    if (x == 1) {
      cin >> x;
      K.push_back({x, i + 1});
    } else {
      cin >> x;
      C.push_back({x, i + 1});
    }
  }
  sort(K.begin(), K.end(), cmp);
  sort(C.begin(), C.end(), cmp);
  l1 = K.size();
  l2 = C.size();
  vector<long> S1(l1 + 1), S2(l2 + 1);
  S1[0] = 0;
  S2[0] = 0;
  for (i = 0; i < l1; i++) S1[i + 1] = S1[i] + K[i].first;
  for (i = 0; i < l2; i++) S2[i + 1] = S2[i] + C[i].first;
  x = -1;
  for (i = 0; i < (l2 + 1); i++) {
    if (i * 2 <= v && S1[min(v - i * 2, l1)] + S2[i] > ans) {
      ans = S1[min(v - i * 2, l1)] + S2[i];
      x = i;
    }
  }
  cout << ans << '\n';
  for (i = 0; i < x; i++) cout << C[i].second << " ";
  for (i = 0; i < (min(v - x * 2, l1)); i++) cout << K[i].second << " ";
  cout << "\n";
  return 0;
}
