#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
long long mul(long long a, long long b, long long p = 1000000007) {
  return ((a % p) * (b % p)) % p;
}
long long add(long long a, long long b, long long p = 1000000007) {
  return (a % p + b % p) % p;
}
void input(long long a[], long long sz) {
  for (long long i = 0; i < sz; i++) cin >> a[i];
}
void print(long long a[], long long sz) {
  for (long long i = 0; i < sz; i++) {
    if (i == sz - 1)
      cout << a[i] << "\n";
    else
      cout << a[i] << " ";
  }
}
long long maxr(long long a[], long long sz) {
  long long ma;
  for (long long i = 0; i < sz; i++) {
    if (i == 0)
      ma = a[i];
    else if (a[i] > ma)
      ma = a[i];
  }
  return ma;
}
long long minr(long long a[], long long sz) {
  long long mi;
  for (long long i = 0; i < sz; i++) {
    if (i == 0)
      mi = a[i];
    else if (a[i] < mi)
      mi = a[i];
  }
  return mi;
}
long long isprm(long long n) {
  if (n <= 1) return 0;
  if (n <= 3) return 1;
  if (n % 2 == 0 || n % 3 == 0) return 0;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return 0;
  return 1;
}
long long power(long long x, long long y, long long p = 1000000007) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long modInverse(long long n, long long p = 1000000007) {
  return power(n, p - 2, p);
}
struct comp {
  bool operator()(const pair<long long, long long> &a,
                  const pair<long long, long long> &b) const {
    if (a.first == b.first) {
      return (a.second > b.second);
    }
    return (a.first < b.first);
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long n, k;
  cin >> n >> k;
  long long a[n + 5];
  input(a, n);
  sort(a, a + n);
  vector<pair<long long, long long>> v;
  map<long long, long long> mp;
  for (long long i = 0; i < n; i++) {
    mp[a[i]]++;
  }
  for (auto i : mp) v.push_back(make_pair(i.first, i.second));
  long long j = v.size() - 1, i = 0;
  long long mi = v[0].first, ma = v[j].first;
  while (k > 0 && i < j && (k >= v[i].second || k >= v[j].second)) {
    if (v[i].second <= v[j].second) {
      long long h = k / v[i].second;
      long long d = min(v[i].first + h, v[i + 1].first);
      k -= ((d - v[i].first) * v[i].second);
      mi = d;
      if (d == v[i + 1].first) {
        v[i + 1].second += v[i].second;
        i++;
      }
    } else {
      long long h = k / v[j].second;
      long long d = max(v[j].first - h, v[j - 1].first);
      k -= ((v[j].first - d) * v[j].second);
      ma = d;
      if (d == v[j - 1].first) {
        v[j - 1].second += v[j].second;
        j--;
      }
    }
    if (k <= 0 || i == j || (k < v[j].second && k < v[i].second)) break;
  }
  cout << ma - mi << "\n";
  return 0;
}
