#include <bits/stdc++.h>
using namespace std;
int n;
int x[1011], b[1011], l, tr[1011];
double f[1011];
bool check(double res) {
  for (int i = (0), _b = (n); i <= _b; i++) {
    if (i == 0)
      f[i] = 0;
    else {
      f[i] = 1e12;
      tr[i] = 1;
      for (int j = (0), _b = (i - 1); j <= _b; j++)
        if (f[j] < 1e11) {
          double cur = f[j] - res * b[i] + sqrt(fabs(x[i] - x[j] - l));
          if (cur < f[i]) {
            f[i] = cur;
            tr[i] = j;
          }
        }
    }
  }
  return f[n] <= 0;
}
vector<int> ans;
void trace(int n) {
  if (n == 0) return;
  ans.push_back(n);
  trace(tr[n]);
}
int main() {
  ios ::sync_with_stdio(false);
  cin.tie(NULL);
  cout << (fixed) << setprecision(6);
  while (cin >> n >> l) {
    for (int i = (1), _b = (n); i <= _b; i++) cin >> x[i] >> b[i];
    if (n == 1) {
      cout << 1 << endl;
      continue;
    }
    double l = 0, r = 1e6, res = r;
    for (int turn = 0, _a = (50); turn < _a; turn++) {
      double mid = (l + r) / 2.0;
      if (check(mid)) {
        res = mid;
        r = mid;
      } else
        l = mid;
    }
    check(res);
    ans.clear();
    trace(n);
    reverse(ans.begin(), ans.end());
    for (int i = 0, _a = (ans.size()); i < _a; i++) cout << ans[i] << ' ';
    cout << endl;
    break;
  }
  return 0;
}
