#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
int n, l;
const double eps = 1e-9;
int cmp(double a, double b) {
  if (fabs(a - b) < eps) return 0;
  return a > b ? 1 : -1;
}
int x[1005], b[1005];
double dp[1005];
int path[1005];
bool check(double r) {
  for (int i = 1; i <= n; i++) {
    dp[i] = DBL_MAX;
    path[i] = 0;
  }
  dp[0] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < i; j++) {
      double c = sqrt(abs(x[i] - x[j] - l)) - b[i] * r;
      if (dp[j] + c < dp[i]) {
        dp[i] = dp[j] + c;
        path[i] = j;
      }
    }
  }
  return cmp(dp[n], 0) <= 0;
}
int main() {
  scanf("%d %d", &n, &l);
  for (int i = 1; i <= n; i++) {
    scanf("%d %d", &x[i], &b[i]);
  }
  double lo = 0;
  double hi = 1000000;
  double ans = 0;
  for (int it = 0; it < 100; it++) {
    double mid = (lo + hi) / 2;
    if (check(mid)) {
      ans = mid;
      hi = mid;
    } else
      lo = mid;
  }
  check(ans);
  vector<int> v;
  int x = n;
  while (x != 0) {
    v.push_back(x);
    x = path[x];
  }
  reverse(v.begin(), v.end());
  for (auto &x : v) {
    printf("%d ", x);
  }
  puts("");
  return 0;
}
