#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
const double eps = 1e-10;
int n, L, a[maxn], b[maxn];
double f[maxn];
int pnt[maxn];
bool solve(double x) {
  for (int i = 1; i <= n; i++) f[i] = -100000.0, pnt[i] = -1;
  for (int i = 0; i < n; i++) {
    if (f[i] < -1000.0) continue;
    for (int j = i + 1; j <= n; j++) {
      double tt = x * b[j] - sqrt((double)abs(L - (a[j] - a[i])));
      if (f[j] < f[i] + tt) {
        f[j] = f[i] + tt;
        pnt[j] = i;
      }
    }
  }
  return f[n] > -eps;
}
vector<int> ans;
int main() {
  scanf("%d%d", &n, &L);
  for (int i = 1; i <= n; i++) scanf("%d%d", &a[i], &b[i]);
  double ret = -100, l = 0, r = 1000000000.0;
  while (l + eps < r) {
    double m = (l + r) / 2;
    if (solve(m)) {
      ret = m;
      r = m;
    } else
      l = m;
  }
  ans.clear();
  int cur = n;
  while (cur) {
    ans.push_back(cur);
    cur = pnt[cur];
  }
  for (int i = (int)ans.size() - 1; i >= 0; i--)
    printf("%d%c", ans[i], i ? ' ' : '\n');
  return 0;
}
