#include <bits/stdc++.h>
using namespace std;
bool myfun(int a, int b) { return a > b; }
int arr[500];
vector<int> v;
int solve(int m, int n) {
  int sum = 0;
  for (int i = m; i < n - 1; i++) {
    sum += v[i];
  }
  return sum;
}
int main() {
  int n, d;
  scanf("%d %d", &n, &d);
  for (int i = 0; i < n; i++) {
    scanf("%d", &arr[i]);
  }
  if (d == 0) {
    printf("%d\n", 0);
    return 0;
  }
  if (n == 1) {
    if (d > arr[0])
      printf("%d\n", 0);
    else
      printf("%d\n", 1);
    return 0;
  }
  for (int i = 0; i < n - 1; i++) {
    int lol = abs(arr[i] - arr[i + 1]);
    v.push_back(lol);
  }
  sort(v.begin(), v.end(), myfun);
  int lol, ct = 0;
  for (int i = 0; i < n - 1; i++) {
    lol = solve(i, n);
    if (d >= lol) {
      break;
    } else
      ct++;
  }
  printf("%d\n", ct);
  return 0;
}
