#include <bits/stdc++.h>
using namespace std;
const int32_t N = 1010;
long long n, l;
long double x[N], dis[N], b[N], store[N][N], g[N][N];
bool vis[N];
long double minDis(long long u) {
  if (u == n) return 0;
  if (vis[u]) return dis[u];
  vis[u] = true;
  long double &ans = dis[u];
  ans = 1e9;
  for (long long v = u + 1; v <= n; ++v) ans = min(ans, g[u][v] + minDis(v));
  return ans;
}
void path(long long u) {
  if (u == n) return;
  for (long long v = u + 1; v <= n; ++v) {
    if (dis[u] == g[u][v] + dis[v]) {
      cout << v << " ";
      path(v);
      return;
    }
  }
}
bool check(long double k, bool print) {
  for (long long i = 0; i <= n; ++i)
    for (long long j = i + 1; j <= n; ++j) g[i][j] = store[i][j] - k * b[j];
  memset(vis, 0, sizeof(vis));
  long double mx = minDis(0);
  if (print) path(0);
  return mx <= 0;
}
int32_t main() {
  cin >> n >> l;
  for (long long i = 1; i <= n; ++i) cin >> x[i] >> b[i];
  for (long long i = 0; i <= n; ++i) {
    for (long long j = i + 1; j <= n; ++j) {
      store[i][j] = sqrtl(abs(x[j] - x[i] - l));
    }
  }
  long double lo = 0, hi = 1e9;
  for (long long i = 0; i <= 100; ++i) {
    long double mid = (lo + hi) / 2;
    if (check(mid, 0))
      hi = mid;
    else
      lo = mid;
  }
  check(lo, 1);
  return 0;
}
