There are $n$ students numerated from $1$ to $n$. The level of the $i$-th student is $a_i$. You need to split the students into stable groups. A group of students is called stable, if in the sorted array of their levels no two neighboring elements differ by more than $x$.

For example, if $x = 4$, then the group with levels $[1, 10, 8, 4, 4]$ is stable (because $4 - 1 \le x$, $4 - 4 \le x$, $8 - 4 \le x$, $10 - 8 \le x$), while the group with levels $[2, 10, 10, 7]$ is not stable ($7 - 2 = 5 > x$).

Apart from the $n$ given students, teachers can invite at most $k$ additional students with arbitrary levels (at teachers' choice). Find the minimum number of stable groups teachers can form from all students (including the newly invited).

For example, if there are two students with levels $1$ and $5$; $x = 2$; and $k \ge 1$, then you can invite a new student with level $3$ and put all the students in one stable group.


-----Input-----

The first line contains three integers $n$, $k$, $x$ ($1 \le n \le 200000$, $0 \le k \le 10^{18}$, $1 \le x \le 10^{18}$) — the initial number of students, the number of students you can additionally invite, and the maximum allowed level difference.

The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^{18}$) — the students levels.


-----Output-----

In the only line print a single integer: the minimum number of stable groups you can split the students into.


-----Examples-----

Input
8 2 3
1 1 5 8 12 13 20 22
Output
2
Input
13 0 37
20 20 80 70 70 70 420 5 1 5 1 60 90
Output
3


-----Note-----

In the first example you can invite two students with levels $2$ and $11$. Then you can split the students into two stable groups:

$[1, 1, 2, 5, 8, 11, 12, 13]$,

$[20, 22]$.

In the second example you are not allowed to invite new students, so you need $3$ groups:

$[1, 1, 5, 5, 20, 20]$

$[60, 70, 70, 70, 80, 90]$

$[420]$

Difficulty: EASY

Solutions:
R = lambda : map(int, input().split())
(n, k, x) = R()
a = sorted(R())
for u in sorted((max(v - u, x) for (u, v) in zip(a, a[1:]))):
	k += -u // x + 1
	n -= k >= 0
print(n)


import random
import math
from collections import defaultdict
import itertools
from sys import stdin, stdout
import sys
import operator

def main():
	z = ''
	(n, k, x) = list(map(int, input().split()))
	a = list(map(int, input().split()))
	a.sort()
	diff = []
	for i in range(n - 1, 0, -1):
		if a[i] - a[i - 1] > x:
			if k > 0 and a[i] - a[i - 1] <= 2 * x:
				k -= 1
			else:
				diff.append(a[i] - a[i - 1])
	if k == 0:
		print(len(diff) + 1)
	else:
		diff.sort()
		l = len(diff) + 1
		p = l - 1
		ans = 0
		for i in range(p):
			if diff[i] % x == 0:
				if k >= diff[i] // x - 1:
					k -= diff[i] // x - 1
					l -= 1
				else:
					break
			elif k >= diff[i] // x:
				k -= diff[i] // x
				l -= 1
			else:
				break
		print(l)
main()


class Solution:

	def stableGroups(self, N, K, X, stuLevel):
		groups = 1
		gapSize = []
		prev = stuLevel[0]
		for level in stuLevel:
			fill = 0
			if prev + X < level:
				fill = (level - prev - 1) // X
				gapSize.append(fill)
				groups += 1
			prev = level
		(N, i) = (len(gapSize), 0)
		gapSize.sort()
		while i < N and K >= gapSize[i]:
			K -= gapSize[i]
			groups -= 1
			i += 1
		return groups
s = Solution()
t = 1
while t:
	(N, K, X) = map(int, input().split(' '))
	arr = list(map(int, input().split(' ')))
	arr.sort()
	print(s.stableGroups(N, K, X, arr))
	t -= 1


(n, k, x) = map(int, input().split())
array = sorted(list(map(int, input().split())))
array2 = []
for i in range(n - 1):
	val = (array[i + 1] - array[i] - 1) // x
	if val > 0:
		array2.append(val)
if len(array2) == 0:
	print(1)
else:
	array2.sort()
	cum = 0
	for i in range(len(array2)):
		cum += array2[i]
		if cum > k:
			print(len(array2) - i + 1)
			break
	else:
		print(1)


import sys, math
from collections import deque, defaultdict
import operator as op
from functools import reduce
from itertools import permutations
import heapq
I = sys.stdin.readline
alpha = 'abcdefghijklmnopqrstuvwxyz'
mod = 10 ** 9 + 7

def ii():
	return int(I().strip())

def li():
	return list(map(int, I().strip().split()))

def mi():
	return map(int, I().strip().split())

def ncr(n, r):
	r = min(r, n - r)
	numer = reduce(op.mul, range(n, n - r, -1), 1)
	denom = reduce(op.mul, range(1, r + 1), 1)
	return numer // denom

def ispali(s):
	i = 0
	j = len(s) - 1
	while i < j:
		if s[i] != s[j]:
			return False
		i += 1
		j -= 1
	return True

def isPrime(n):
	if n <= 1:
		return False
	elif n <= 2:
		return True
	else:
		for i in range(2, int(n ** 0.5) + 1):
			if n % i == 0:
				return False
		return True

def main():
	(n, k, x) = mi()
	arr = sorted(li())
	tmp = []
	last = arr[0]
	for i in range(1, n):
		if arr[i] - last > x:
			tmp.append(arr[i] - last - 1)
		last = arr[i]
	tmp.sort()
	ntmp = len(tmp)
	for i in tmp:
		needk = math.floor(i // x)
		if k >= needk:
			ntmp -= 1
			k -= needk
	print(ntmp + 1)
main()


(n, k, x) = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
l = []
for i in range(1, n):
	t = a[i] - a[i - 1]
	if t > x:
		if t % x == 0:
			l.append(t // x - 1)
		else:
			l.append(t // x)
l.sort()
s = 0
ans = len(l) + 1
for i in range(len(l)):
	s = s + l[i]
	if s > k:
		break
	ans -= 1
print(ans)


(n, k, x) = map(int, input().split())
levels = sorted(list(map(int, input().split())))
diffs = []
for i in range(n - 1):
	diff = levels[i + 1] - levels[i]
	if diff <= x:
		continue
	else:
		diffs.append((diff - 1) // x)
diffs.sort()
counter = 0
if len(diffs) == 0:
	print(1)
else:
	for j in range(len(diffs)):
		if k - diffs[j] < 0:
			break
		k -= diffs[j]
		counter += 1
	print(len(diffs) + 1 - counter)


import math
import sys
input = sys.stdin.buffer.readline
(N, K, X) = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
diffs = sorted([A[i + 1] - A[i] for i in range(N - 1)])
ans = 1
for diff in diffs:
	if diff > X:
		need = (diff - 1) // X
		if need <= K:
			K -= need
		else:
			ans += 1
print(ans)


from collections import defaultdict, Counter
from math import sqrt, log10, log2, log, gcd, floor, factorial
from bisect import bisect_left, bisect_right
from itertools import combinations, combinations_with_replacement
import sys, io, os
input = sys.stdin.readline
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
mod = 10 ** 9 + 7
inf = float('inf')
get_list = lambda : [int(i) for i in input().split()]

def yn(a):
	print('YES' if a else 'NO')
ceil = lambda a, b: (a + b - 1) // a
t = 1
for i in range(t):
	(n, k, x) = get_list()
	l = get_list()
	l.sort()
	diff = []
	for i in range(1, n):
		if l[i] - l[i - 1] > x:
			diff.append((l[i] - l[i - 1] - 1) // x)
	diff.sort()
	groups = len(diff) + 1
	iter1 = 0
	while iter1 < len(diff):
		req = diff[iter1]
		if k >= req:
			k -= req
			groups -= 1
		else:
			break
		iter1 += 1
	print(groups)


import math
import os
import sys
from math import ceil, floor, sqrt, gcd, factorial
from io import BytesIO, IOBase
from collections import Counter
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def prog_name():
	(n, k, d) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort()
	cnt = 1
	diff_l = []
	for x in range(n - 1):
		if l[x + 1] - l[x] > d:
			cnt += 1
			if (l[x + 1] - l[x]) % d == 0:
				diff_l.append((l[x + 1] - l[x]) // d - 1)
			else:
				diff_l.append((l[x + 1] - l[x]) // d)
	diff_l.sort()
	for y in diff_l:
		if k - y >= 0:
			k -= y
			cnt -= 1
		else:
			break
	print(cnt)

def main():
	T = 1
	for unique in range(T):
		prog_name()
main()


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def solve():
	(n, k, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort()
	d = []
	for i in range(n - 1):
		if arr[i + 1] - arr[i] > x:
			d.append((arr[i + 1] - arr[i] - 1) // x)
	if not d:
		return 1
	d.sort()
	(i, s) = (-1, 0)
	while i < len(d) - 1 and s + d[i + 1] <= k:
		i += 1
		s += d[i]
	return len(d) - i
print(solve())


import math
from ctypes import c_longlong as ll

def solve(n, k, x, a):
	a.sort()
	diffs = []
	ans = 1
	for i in range(1, n):
		if a[i] - a[i - 1] > x:
			diffs.append(a[i] - a[i - 1])
			ans += 1
	diffs.sort()
	for d in diffs:
		if k > 0 and k >= (d - 1) // x:
			k -= (d - 1) // x
			ans -= 1
	return ans
(n, k, x) = map(int, input().split())
a = list(map(int, input().split()))
print(solve(n, k, x, a))


import heapq
import math
(n, k, x) = list(map(int, input().rstrip().split()))
arr = list(map(int, input().rstrip().split()))
arr.sort()
diff = []
breaks = 0
heapq.heapify(diff)
for i in range(1, n):
	if arr[i] - arr[i - 1] <= x:
		continue
	else:
		heapq.heappush(diff, arr[i] - arr[i - 1])
		breaks += 1
for i in range(len(diff)):
	temp = heapq.heappop(diff)
	if temp % x == 0:
		req = temp // x - 1
		if k < req:
			heapq.heappush(diff, temp)
			break
		else:
			breaks -= 1
			k -= req
	else:
		req = temp // x
		if k < req:
			heapq.heappush(diff, temp)
			break
		else:
			breaks -= 1
			k -= req
print(len(diff) + 1)


import sys, os
from io import BytesIO, IOBase
mod = 10 ** 9 + 7
Mod = 998244353
INF = float('inf')
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
inp = lambda : list(map(int, sys.stdin.readline().rstrip('\r\n').split()))
tc = 1
for test in range(1, tc + 1):
	(n, k, x) = inp()
	a = inp()
	a.sort()
	ans = 1
	stack = []
	for i in range(1, n):
		d = a[i] - a[i - 1]
		if d % x == 0:
			d = max(0, d // x - 1)
		else:
			d = d // x
		if d != 0:
			stack.append(d)
	d = stack
	d.sort(reverse=True)
	n = len(d)
	for i in range(n - 1, -1, -1):
		k -= d[i]
		if k < 0:
			ans += i + 1
			break
	print(ans)


import sys
from sys import stdin, stdout
from math import ceil, floor, sqrt, log, log2, log10
from collections import Counter
int_max = float('inf')
int_min = -float('inf')
ANS = []
input = stdin.readline

def solve():
	pass
t = 1
for i in range(t):
	(n, k, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort()
	gaps = []
	for i in range(1, n):
		if arr[i] - arr[i - 1] > x:
			gaps.append(arr[i] - arr[i - 1])
	total = len(gaps) + 1
	gaps.sort()
	for i in gaps:
		if k <= 0:
			break
		if i % x == 0 and k >= i // x - 1:
			k -= i // x - 1
			total -= 1
		elif i % x > 0 and k >= i // x:
			k -= i // x
			total -= 1
	ANS.append(str(total))
print('\n'.join(ANS))


(n, k, x) = map(int, input().split())
v = list(map(int, input().split()))
v.sort()
w = []
for i in range(n - 1):
	dif = max((v[i + 1] - v[i] - 1) // x, 0)
	w.append(dif)
w.sort()
aux = 0
res = n
for i in range(len(w)):
	aux += w[i]
	if aux > k:
		res = i
		break
print(max(n - res, 1))


import sys
parse_input = lambda : sys.stdin.readline().rstrip('\r\n')

def func(arr, n, k, x):
	count = 1
	gaps = []
	arr = sorted(arr)
	for i in range(0, n - 1):
		if arr[i + 1] - arr[i] > x:
			if (arr[i + 1] - arr[i]) % x == 0:
				add = (arr[i + 1] - arr[i]) // x - 1
			else:
				add = (arr[i + 1] - arr[i]) // x
			gaps.append(add)
	gaps.sort()
	for gap in gaps:
		if k > 0:
			if gap <= k:
				k -= gap
			else:
				count += 1
		else:
			count += 1
	return count

def main():
	(n, k, x) = [int(i) for i in parse_input().split()]
	arr = [int(i) for i in parse_input().split()]
	print(func(arr, n, k, x))
main()


(n, k, x) = map(int, input().split())
a = sorted(list(map(int, input().split())))
s = []
for i in range(n - 1):
	if a[i + 1] - a[i] > x:
		s.append(a[i + 1] - a[i])
size = len(s) + 1
s.sort()
for i in s:
	f = (i - 1) // x
	if f <= k:
		k -= f
		size -= 1
	else:
		break
print(size)


from math import ceil

def main():
	(n, k, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())))
	b = []
	for i in range(1, n):
		b.append((a[i] - a[i - 1] - 1) // x)
		if b[-1] <= 0:
			b.pop()
	b.sort()
	i = 0
	while i < len(b) and k >= b[i]:
		k -= b[i]
		i += 1
	print(len(b) - i + 1)
main()


R = lambda : map(int, input().split())
s = sorted
(n, k, x) = R()
a = s(R())
r = len((b := s((max(v - u, x) for (u, v) in zip(a, a[1:]))))) + 1
for u in b:
	k += -u // x + 1
	if k < 0:
		break
	r -= 1
print(r)


(n, k, x) = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
li = []
for i in range(1, n):
	if a[i] - a[i - 1] > x:
		li.append(a[i] - a[i - 1])
li.sort()
i = 0
l = len(li)
c = l
while k > 0 and i < l:
	if li[i] % x == 0:
		t = li[i] // x - 1
	else:
		t = li[i] // x
	k -= t
	if k >= 0:
		c -= 1
	i += 1
print(c + 1)


(n, k, x) = map(int, input().split(' '))
a = list(map(int, input().split(' ')))
a.sort(reverse=True)
a.append(-x - 10)
g = []
start = 0
for i in range(1, len(a)):
	if a[i - 1] - a[i] > x:
		g.append([a[start], a[i - 1]])
		start = i
dif = []
for i in range(len(g) - 1):
	if (g[i][-1] - g[i + 1][0]) % x == 0:
		dif.append((g[i][-1] - g[i + 1][0]) // x - 1)
	else:
		dif.append((g[i][-1] - g[i + 1][0]) // x)
Groups = len(g)
dif.sort()
for i in range(len(dif)):
	if k >= dif[i]:
		k -= dif[i]
		dif[i] = 0
		Groups -= 1
	else:
		break
print(Groups)


from itertools import *
from operator import *
R = lambda : map(int, input().split())
s = sorted
(n, k, x) = R()
a = s(R())
for u in s(map(max, repeat(x), map(sub, a[1:], a))):
	k += -u // x + 1
	n -= k >= 0
print(n)


from sys import stdin

def read_int():
	return int(stdin.readline())

def read_ints():
	return map(int, stdin.readline().split(' '))
(n, k, x) = read_ints()
a = list(read_ints())
a.sort()
delta = []
for i in range(n - 1):
	if a[i + 1] - a[i] > x:
		delta.append(a[i + 1] - a[i])
delta.sort()
ans = len(delta) + 1
for d in delta:
	if k >= (d - 1) // x:
		ans -= 1
		k -= (d - 1) // x
print(ans)


(n, k, x) = map(int, input().split())
a = list(map(int, input().split()))
a = sorted(a)
diff = [0] * (len(a) - 1)
for i in range(len(a) - 1):
	diff[i] = a[i + 1] - a[i]
diff = sorted(diff)
answer = 1
for d in diff:
	if d > x:
		add = (d - 1) // x
		if k - add < 0:
			answer += 1
		else:
			k -= add
print(answer)


def naiveSolve():
	return

def main():
	(n, k, x) = readIntArr()
	a = readIntArr()
	a.sort()
	largeGaps = []
	for i in range(1, n):
		gap = a[i] - a[i - 1]
		if gap > x:
			largeGaps.append(gap)
	m = len(largeGaps)
	gapFillStudCnts = [-1] * m
	for i in range(m):
		gapFillStudCnts[i] = (largeGaps[i] - 1) // x
	gapFillStudCnts.sort()
	ans = m + 1
	for x in gapFillStudCnts:
		k -= x
		if k >= 0:
			ans -= 1
	print(ans)
	return
import sys
input = sys.stdin.buffer.readline

def oneLineArrayPrint(arr):
	print(' '.join([str(x) for x in arr]))

def multiLineArrayPrint(arr):
	print('\n'.join([str(x) for x in arr]))

def multiLineArrayOfArraysPrint(arr):
	print('\n'.join([' '.join([str(x) for x in y]) for y in arr]))

def readIntArr():
	return [int(x) for x in input().split()]

def makeArr(defaultValFactory, dimensionArr):
	dv = defaultValFactory
	da = dimensionArr
	if len(da) == 1:
		return [dv() for _ in range(da[0])]
	else:
		return [makeArr(dv, da[1:]) for _ in range(da[0])]

def queryInteractive(a, b):
	print('? {} {}'.format(a, b))
	sys.stdout.flush()
	return True if input() == 'SI' else False

def answerInteractive(ans):
	print('! {}'.format(ans))
	sys.stdout.flush()
inf = float('inf')
MOD = 10 ** 9 + 7
from math import gcd, floor, ceil
for _abc in range(1):
	main()


import sys, math
(n, k, x) = map(int, sys.stdin.readline().split())
ans = 1
arr = list(map(int, sys.stdin.readline().split()))
arr.sort()
temp = []
for i in range(1, n):
	if arr[i] - arr[i - 1] > x:
		ans += 1
		temp.append((arr[i] - arr[i - 1] - 1) // x)
temp.sort()
for i in temp:
	if i <= k:
		ans -= 1
		k -= i
	else:
		break
print(ans)


(n, k, x) = list(map(int, input().split()))
v = list(map(int, input().split()))
v.sort()
l = []
for i in range(1, n):
	d = v[i] - v[i - 1]
	if d > x:
		l.append((d - 1) // x)
l.sort()
mini = len(l) + 1
for i in l:
	if k >= i:
		k -= i
		mini -= 1
print(mini)


import collections
from math import ceil, gcd, sqrt, log
INF = float('inf')
mod = 1000000007

def solve():
	(n, k, x) = map(int, input().split())
	A = list(map(int, input().split()))
	ans = []
	A.sort()
	for i in range(n - 1):
		if A[i + 1] - A[i] > x:
			ans.append(A[i + 1] - A[i])
	ans.sort()
	net = len(ans) + 1
	for i in ans:
		if k > 0:
			if i % x == 0:
				temp = i // x - 1
			else:
				temp = i // x
			if temp > k:
				break
			net -= 1
			k -= temp
	print(net)
t = 1
while t != 0:
	solve()
	t -= 1


(n, k, x) = map(int, input().split())
l = sorted(list(map(int, input().split())))
d = []
ans = 1
for i in range(len(l) - 1):
	t = l[i + 1] - l[i]
	if t > x:
		d.append((t - 1) // x)
		ans += 1
d.sort()
for i in d:
	if k >= i:
		k = k - i
		ans -= 1
	else:
		break
print(ans)


from math import ceil
from sys import stdin
input = stdin.readline

def f(k, x, a):
	ans = 1
	a = sorted(a)
	l = 0
	ts = a[0]
	joincost = []
	for i in a[1:]:
		if i - ts <= x:
			ts = i
		else:
			l += 1
			joincost.append((i - ts + x - 1) // x - 1)
			ts = i
	l += 1
	cans = l
	t = 0
	red = 0
	joincost = sorted(joincost)
	for pp in joincost:
		if t + pp <= k:
			red += 1
			t += pp
		else:
			break
	return cans - red
(n, k, x) = map(int, input().strip().split())
a = list(map(int, input().strip().split()))
print(f(k, x, a))


from sys import stdin

def solve(k, x, levels):
	sorted_levels = sorted(levels)
	diffs = []
	for i in range(1, len(sorted_levels)):
		if sorted_levels[i] - sorted_levels[i - 1] > x:
			diffs.append(sorted_levels[i] - sorted_levels[i - 1])
	diffs.sort(reverse=True)
	m = len(diffs)
	for i in range(m - 1, -1, -1):
		if (diffs[i] - 1) // x <= k:
			k -= (diffs[i] - 1) // x
			diffs.pop()
	return len(diffs) + 1

def main():
	nums = list(map(int, stdin.readline().split()))
	(_, k, x) = (nums[0], nums[1], nums[2])
	levels = list(map(int, stdin.readline().split()))
	print(solve(k, x, levels))
main()


import sys
input = lambda : sys.stdin.readline()
int_arr = lambda : list(map(int, input().split()))
str_arr = lambda : list(map(str, input().split()))
get_str = lambda : map(str, input().split())
get_int = lambda : map(int, input().split())
get_flo = lambda : map(float, input().split())
mod = 1000000007

def solve(n, k, x, arr):
	arr.sort()
	df = []
	for i in range(1, len(arr)):
		diff = arr[i] - arr[i - 1]
		if diff > x:
			if diff % x == 0:
				df.append(diff // x - 1)
			else:
				df.append(diff // x)
	df.sort()
	i = 0
	while i < len(df):
		k -= df[i]
		if k < 0:
			break
		i += 1
	print(len(df) - i + 1)
(n, k, x) = get_int()
arr = int_arr()
solve(n, k, x, arr)


(n, k, x) = map(int, input().split())
integers = list(map(int, input().split()))
integers.sort()
groups = [j - i for (i, j) in zip(integers, integers[1:]) if j - i > x]
groups.sort()
ans = len(groups) + 1
for dis in groups:
	y = (dis + x - 1) // x - 1
	if y <= k:
		ans -= 1
		k -= y
	else:
		break
print(ans)


import heapq
import math
(n, k, x) = map(int, input().split())
lis = list(map(int, input().split()))
intemp = k
lis.sort()
count = 1
ex = []
for i in range(n - 1):
	val = lis[i + 1] - lis[i]
	if val > x:
		ex.append(val)
		count += 1
heapq.heapify(ex)
while True:
	if k == 0:
		break
	try:
		val = heapq.heappop(ex)
	except:
		break
	temp = val // x
	if val % x == 0:
		temp -= 1
	if temp > k:
		break
	else:
		count -= 1
		k -= temp
print(count)


(n, k, x) = [int(i) for i in input().split()]
arr = [int(i) for i in input().split()]
arr = sorted(arr)
diff = [(arr[i + 1] - arr[i] - 1) // x for i in range(0, len(arr) - 1) if arr[i + 1] - arr[i] > x]
count = 0
newList = sorted(diff)
for i in newList:
	if k >= i:
		count += 1
		k = k - i
	else:
		break
print(len(newList) - count + 1)


(n, k, x) = map(int, input().split())
arr = list(map(int, input().split()))
arr.sort()
ans = []
for i in range(1, n):
	if x < arr[i] - arr[i - 1]:
		ans.append((arr[i] - arr[i - 1] - 1) // x)
ans.sort(reverse=True)
while len(ans):
	if ans[len(ans) - 1] <= k:
		k -= ans[len(ans) - 1]
		ans.pop()
		continue
	break
print(len(ans) + 1)


(n, k, x) = map(int, input().split())
li = list(map(int, input().split()))
li.sort()
needed_li = []
for i in range(1, n):
	value = li[i] - li[i - 1]
	if value <= x:
		continue
	else:
		needed_li.append((value - 1) // x)
needed_li.sort()
deleted_diff_element_count = 0
for needed in needed_li:
	if needed <= k:
		deleted_diff_element_count += 1
		k -= needed
	else:
		break
print(len(needed_li) - deleted_diff_element_count + 1)


from collections import deque
import heapq
from math import sqrt
import operator
from operator import itemgetter
import sys
inf_var = 0
if inf_var == 1:
	inf = open('input.txt', 'r')
else:
	inf = sys.stdin
input = inf.readline

def read_one_int():
	return int(input().rstrip('\n'))

def read_one_float():
	return float(input().rstrip('\n'))

def read_list_of_ints():
	res = [int(val) for val in input().rstrip('\n').split(' ')]
	return res

def read_str():
	return input().rstrip()

def main():
	(n, k, x) = read_list_of_ints()
	numbers = read_list_of_ints()
	numbers.sort()
	interval_cnt = 1
	intervals = []
	for i in range(1, n):
		l = numbers[i - 1]
		r = numbers[i]
		delta = r - l
		if delta > x:
			interval_cnt += 1
			intervals.append((delta - 1) // x)
	if interval_cnt == 1:
		print(1)
		return
	intervals.sort()
	for add_pup in intervals:
		k -= add_pup
		if k > -1:
			interval_cnt -= 1
		else:
			break
	print(interval_cnt)
main()


lists1 = list(map(int, input().split()))
nums = lists1[0]
additional = lists1[1]
diff = lists1[2]
lists = list(map(int, input().split()))
lists = sorted(lists)
ans = []
for i in range(1, len(lists)):
	difference = lists[i] - lists[i - 1]
	if difference <= diff:
		continue
	ans.append((difference - 1) // diff)
ans = sorted(ans)
count = len(ans) + 1
toAdd = 0
for i in ans:
	if i <= additional:
		count -= 1
		additional -= i
print(count)


(N, K, X) = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
ds = [b - a for (a, b) in zip(A, A[1:])]
ds.sort()
from bisect import bisect
i = bisect(ds, X)
ds = ds[i:]
ds.reverse()
while K > 0 and ds:
	d = ds[-1]
	k = (d - 1) // X
	if K >= k:
		ds.pop()
	K -= k
print(len(ds) + 1)


import sys
from os import path
import bisect
if path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output1.txt', 'w')
from heapq import heappop, heappush, heapify
from math import ceil
from collections import defaultdict
maxi = sys.maxsize
mini = -maxi
(n, k, x) = map(int, sys.stdin.readline().split())
l = list(map(int, sys.stdin.readline().split()))
l.sort()
ans = []
for i in range(n - 1):
	d = l[i + 1] - l[i]
	if d > x:
		d -= 1
		d = d // x
		ans.append(d)
ans.sort(reverse=True)
n = len(ans)
while n:
	if ans[n - 1] > k:
		break
	k -= ans[n - 1]
	n -= 1
print(n + 1)


(n, k, x) = map(int, input().split())
u = sorted(list(map(int, input().split())))
ans = 1
p = []
for i in range(1, n):
	d = u[i] - u[i - 1]
	if d <= x:
		continue
	p.append((d - 1) // x)
	ans += 1
p.sort()
for i in range(len(p)):
	if p[i] <= k:
		k -= p[i]
		ans -= 1
	else:
		break
print(ans)


(n, k, x) = map(int, input().split())
z = list(map(int, input().split()))

def f(n, k, x, z):
	if n == 1:
		return 1
	z = sorted(z)
	d = sorted([z2 - z1 for (z1, z2) in zip(z, z[1:]) if z2 - z1 > x])
	if len(d) == 0:
		return 1
	q = [(dd - 1) // x for dd in d]
	s = 0
	for (i, qq) in enumerate(q):
		if k < s + qq:
			break
		s += qq
	else:
		i += 1
	return len(q) - i + 1
print(f(n, k, x, z))


import math
(n, k, x) = map(int, input().split())
l = list(map(int, input().split()))
v = []
if n == 1 and l[0] <= x:
	print(1)
else:
	l.sort()
	ans = 1
	for i in range(n - 1):
		if l[i + 1] - l[i] > x:
			ans += 1
			v.append((l[i + 1] - l[i] - 1) // x)
	v.sort()
	for i in v:
		if k == 0:
			break
		elif i <= k:
			ans -= 1
			k -= i
	print(ans)


import io
import os
import sys
import math
import heapq
import bisect
import random
import string
import decimal
import functools
import fractions
import itertools
import collections
from sys import stdin, stdout
from io import BytesIO, IOBase
from math import gcd, floor, sqrt, log, factorial
from bisect import bisect_left, bisect_right
from collections import deque, Counter, defaultdict, OrderedDict, namedtuple, UserDict, UserList, UserString
MOD = 1000000007
sys.setrecursionlimit(100000000)
BUFSIZE = 8192
(n, k, x) = map(int, input().split())
arr = list(map(int, input().split()))
arr.sort()
diffArr = []
for i in range(1, len(arr)):
	diff = arr[i] - arr[i - 1]
	if diff > x:
		diffArr.append(diff)
res = 0
diffArr.sort()
for diff in diffArr:
	if diff <= (k + 1) * x and k > 0:
		k = k - (diff - 1) // x
	else:
		res += 1
print(res + 1)


def read():
	(n, k, x) = map(int, input().split())
	a = list(map(int, input().split()))
	solve(n, k, x, a)

def solve(n, k, x, a):
	difs = []
	a.sort()
	groups = 1
	for i in range(1, n):
		dif = a[i] - a[i - 1]
		if dif > x:
			groups += 1
			difs.append(dif)
	difs.sort()
	for dif in difs:
		ks = (dif - 1) // x
		if ks > k:
			break
		k -= ks
		groups -= 1
	print(groups)
repeat = 1
for tc in range(repeat):
	read()


(n, k, f) = map(int, input().split())
arr = list(map(int, input().split()))
arr.sort()
res = []
for x in range(1, len(arr)):
	if arr[x] - arr[x - 1] > f:
		res.append((arr[x] - arr[x - 1] - 1) // f)
res.sort()
ans = len(res) + 1
for x in res:
	if k < x:
		break
	else:
		k -= x
		ans -= 1
print(ans)


import math
import string
import random
import sys
from random import randrange
from collections import deque
from collections import defaultdict
from bisect import bisect, bisect_right, bisect_left

def data():
	return sys.stdin.readline().strip()

def mdata():
	return list(map(int, data().split()))

def outl(var):
	sys.stdout.write(' '.join(map(str, var)) + '\n')

def out(var):
	sys.stdout.write(str(var) + '\n')
(n, k, x) = mdata()
a = mdata()
a.sort()
temp = []
for i in range(1, n):
	if a[i] - a[i - 1] > x:
		temp.append(a[i] - a[i - 1])
temp.sort()
i = 0
ans = 1
while i < len(temp):
	p = temp[i] // x
	if temp[i] % x == 0:
		p -= 1
	if p > k:
		ans += len(temp) - i
		break
	k -= p
	i += 1
print(ans)


def func():
	(n, k, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	spaces = []
	arr.sort()
	for i in range(1, n):
		diff = arr[i] - arr[i - 1]
		if diff > x:
			spaces.append(diff)
	l = len(spaces)
	for el in sorted(spaces):
		k_need = (el + x - 1) // x - 1
		if k >= k_need:
			k -= k_need
			l -= 1
		else:
			break
	print(l + 1)
for _ in range(1):
	func()


from bisect import bisect
from itertools import accumulate

def main():
	(n, k, x) = map(int, input().split())
	aa = [int(a) for a in input().split()]
	aa.sort()
	gaps = [(b - a - 1) // x for (a, b) in zip(aa, aa[1:]) if b - a > x]
	res = len(gaps) + 1
	gaps.sort()
	gsum = list(accumulate(gaps))
	res -= bisect(gsum, k)
	print(max(res, 1))
	exit(0)
main()


(n, k, x) = map(int, input().split())
arr = list(map(int, input().split()))
arr = sorted(arr)
lst = []
for i in range(1, n):
	lst.append(arr[i] - arr[i - 1])
lst = sorted(lst)
c = 1
for i in lst:
	if i > x:
		req = (i - 1) // x
		if req <= k:
			k -= req
		else:
			c += 1
print(c)


from __future__ import division, print_function
import math
MOD = math.pow(10, 9) + 7
Local = False
import os
import sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
	from __builtin__ import xrange as range
	from future_builtins import ascii, filter, hex, map, oct, zip

def main():
	print(solve())

def solve():
	(n, k, x) = list(map(int, input().split()))
	arr = list(map(int, input().split()))
	arr.sort()
	required = []
	for i in range(1, n):
		c = (arr[i] - arr[i - 1] - 1) // x
		if c > 0:
			required.append((arr[i] - arr[i - 1] - 1) // x)
	required.sort()
	s = 0
	for (idx, i) in enumerate(required):
		s += i
		if s > k:
			return len(required) - idx + 1
	return 1
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()

def LocalIO():
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
if Local:
	LocalIO()
elif sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


import sys
readline = sys.stdin.readline
(N, K, X) = map(int, readline().split())
A = list(map(int, readline().split()))
A = sorted(A)
gap = []
for i in range(1, N):
	diff = A[i] - A[i - 1]
	if diff <= X:
		continue
	gap += [(diff - 1) // X]
gap = sorted(gap)
all_gap = len(gap)
for i in range(len(gap)):
	K -= gap[i]
	if K < 0:
		print(all_gap - i + 1)
		break
else:
	print(1)


import sys
import math
import collections
import heapq
dy = [1, 0, -1, 0]
dx = [0, 1, 0, -1]
r = sys.stdin.readline
(N, K, X) = map(int, r().split())
L = list(map(int, r().split()))
L.sort()
ans = []
for i in range(N - 1):
	if L[i + 1] - L[i] > X:
		ans.append((L[i + 1] - L[i] - 1) // X)
ans.sort()
cnt = 0
for i in ans:
	if K >= i:
		K -= i
		cnt += 1
	else:
		break
print(len(ans) + 1 - cnt)


(n, k, x) = map(int, input().split())
arr = list(map(int, input().split()))
arr.sort()
d = []
for i in range(n - 1):
	if arr[i + 1] - arr[i] > x:
		d.append((arr[i + 1] - arr[i] - 1) // x)
d.sort()
d.reverse()
while d:
	if d[-1] <= k:
		k -= d[-1]
		d.pop()
	else:
		break
print(len(d) + 1)


(n, k, x) = map(int, input().split())
arr = sorted(map(int, input().split()))
chhele_dhukbe = []
for i in range(1, n):
	diff = arr[i] - arr[i - 1]
	if diff > x:
		(q, r) = divmod(diff, x)
		q -= not r
		chhele_dhukbe.append(q)
count = 0
for chheler_sonkhya in sorted(chhele_dhukbe):
	if k < chheler_sonkhya:
		break
	k -= chheler_sonkhya
	count += 1
print(len(chhele_dhukbe) - count + 1)


(n, k, x) = map(int, input().split())
l = [int(x) for x in input().split()]
l.sort()
ans = 1
need = []
for i in range(1, n):
	if l[i] - l[i - 1] > x:
		need.append((l[i] - l[i - 1] - 1) // x)
		ans += 1
need.sort()
i = 0
while k and i < len(need):
	if need[i] <= k:
		k -= need[i]
		ans -= 1
		i += 1
	else:
		break
print(ans)


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))

def scanf(datatype=str):
	return datatype(sys.stdin.readline().rstrip())

def printf(answer=''):
	return sys.stdout.write(str(answer) + '\n')

def prints(answer):
	return sys.stdout.write(str(answer) + ' ')

def map_input(datatype=str):
	return map(datatype, sys.stdin.readline().split())

def list_input(datatype=str):
	return list(map(datatype, sys.stdin.readline().split()))

def testcase(number: int, solve_function):
	for _ in range(number):
		printf(solve_function())

def solve():
	(n, k, x) = map_input(int)
	arr = list_input(int)
	arr.sort()
	ans = []
	for i in range(1, n):
		if arr[i] - arr[i - 1] > x:
			ans.append((arr[i] - arr[i - 1] - 1) // x)
	ans.sort(reverse=True)
	while ans:
		if ans[len(ans) - 1] <= k:
			k -= ans[len(ans) - 1]
			ans.pop()
		else:
			break
	return len(ans) + 1
printf(solve())


[n, k, x] = [int(x) for x in input().split()]
arr = [int(x) for x in input().split()]
arr.sort()
diffs = []
i = arr[0]
for j in arr[1:]:
	d = j - i
	if d > x:
		if d % x == 0:
			diffs += [d // x - 1]
		else:
			diffs += [d // x]
	i = j
diffs.sort()
n = len(diffs)
for d in diffs:
	if d <= k:
		k -= d
		n -= 1
		if k == 0:
			break
print(n + 1)


(n, k, x) = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
count = 1
d = []
for i in range(1, n):
	if a[i] - a[i - 1] > x:
		d.append((a[i] - a[i - 1] - 1) // x)
		count += 1
if k == 0:
	print(count)
else:
	d.sort()
	m = len(d)
	for i in range(m):
		if k >= d[i]:
			k -= d[i]
			count -= 1
		else:
			break
	print(count)


from sys import stdin, stdout

def solve(l, n, k, x):
	s = []
	for i in range(1, n):
		if l[i] - l[i - 1] > x:
			s.append(l[i] - l[i - 1])
	nn = len(s) + 1
	s.sort()
	for i in s:
		if i % x == 0:
			y = i // x - 1
		else:
			y = i // x
		if k >= y:
			nn = nn - 1
			k -= y
		else:
			break
	stdout.write(str(nn))
	stdout.write('\n')
l = list(stdin.readline().split())
n = int(l[0])
k = int(l[1])
x = int(l[2])
l = [int(x) for x in stdin.readline().split()]
l.sort()
solve(l, n, k, x)


(n, k, x) = map(int, input().split())
l = list(map(int, input().split()))
l.sort()
arr = []
c = 1
for i in range(n - 1):
	if l[i + 1] - l[i] > x:
		a = (l[i + 1] - l[i] - 1) // x
		c += 1
		arr.append(a)
arr.sort()
if k == 0:
	print(c)
else:
	for i in arr:
		if k == 0:
			break
		elif i <= k:
			c -= 1
			k -= i
	print(c)


from sys import stdin
(n, k, x) = map(int, stdin.readline().split())
a = list(map(int, stdin.readline().split()))
a.sort()
prev = a[0]
req = []
for ele in a[1:]:
	if ele - prev > x:
		req.append(-((prev - ele) // x) - 1)
	prev = ele
req.sort()
ans = len(req) + 1
for ele in req:
	if k >= ele:
		k -= ele
		ans -= 1
	else:
		break
print(ans)


from collections import Counter

def solve():
	(n, k, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort()
	l1 = []
	for i in range(1, n):
		if l[i] - l[i - 1] <= x:
			continue
		l1.append((l[i] - l[i - 1] - 1) // x)
	l1.sort()
	ans = len(l1)
	for i in range(len(l1)):
		if k < l1[i]:
			break
		k -= l1[i]
		ans -= 1
	print(ans + 1)
solve()


(n, k, x) = map(int, input().split())
arr = sorted(list(map(int, input().split())))
b = sorted((v - u for (u, v) in zip(arr, arr[1:]) if v - u > x))
r = len(b) + 1
for u in b:
	k += -u // x + 1
	if k < 0:
		break
	r -= 1
print(r)


from collections import Counter, defaultdict, deque
import math
import sys
input = sys.stdin.readline

def solve():
	(n, k, x) = [int(_) for _ in input().split()]
	a = [int(_) for _ in input().split()]
	a.sort()
	prev = a[0]
	i = 1
	res = 1
	cost = []
	while i < n:
		if a[i] - prev <= x:
			prev = a[i]
			i += 1
		else:
			d = a[i] - prev - 1
			m = d // x
			cost.append(m)
			prev = a[i]
			i += 1
	cost.sort()
	ans = len(cost)
	for i in range(ans):
		if cost[i] <= k:
			k -= cost[i]
			ans -= 1
		else:
			break
	print(ans + 1)
tt = 1
for test in range(tt):
	solve()


import math
(n, k, x) = map(int, input().rstrip().split())
a = list(map(int, input().rstrip().split()))
a.sort()
count = 1
l = []
for i in range(0, n - 1):
	if a[i + 1] - a[i] > x:
		t = a[i + 1] - a[i]
		l.append(t)
l.sort(reverse=True)
m = len(l)
for j in range(m - 1, -1, -1):
	if (l[j] - 1) // x <= k:
		k -= (l[j] - 1) // x
		l.pop()
print(len(l) + 1)


(n, k, x) = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
count = 1
lst = []
for i in range(1, n):
	if a[i] - a[i - 1] > x:
		count += 1
		if (a[i] - a[i - 1]) % x == 0:
			lst.append((a[i] - a[i - 1]) // x - 1)
		else:
			lst.append((a[i] - a[i - 1]) // x)
if k <= 0 or count == 1:
	print(count)
else:
	lst.sort()
	idx = 0
	while idx < len(lst) and k >= lst[idx] and (count > 1):
		count -= 1
		k -= lst[idx]
		idx += 1
	print(count)


from __future__ import division, print_function
import os
import sys
from io import BytesIO, IOBase
import math
if sys.version_info[0] < 3:
	from __builtin__ import xrange as range
	from future_builtins import ascii, filter, hex, map, oct, zip
MOD = 10 ** 9 + 7
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def main():
	(n, k, x) = map(int, input().split())
	a = [*map(int, input().split())]
	ans = 1
	b = []
	a.sort()
	for i in range(1, n):
		b.append(a[i] - a[i - 1])
	b.sort()
	for i in b:
		if i > x:
			m = (i - 1) // x
			if m <= k:
				k -= m
			else:
				ans += 1
	print(ans)
main()


(n, k, x) = map(int, input().split(' '))
students = list(map(int, input().split(' ')))
p = []
students.sort()
sg = 1
for i in range(1, len(students)):
	diff = students[i] - students[i - 1] - 1
	if diff // x > 0:
		p.append(diff // x)
		sg += 1
p.sort()
for i in p:
	if k <= 0:
		break
	if k - i >= 0:
		sg -= 1
		k -= i
print(sg)


def main():
	(n, k, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	v = []
	for i in range(1, n):
		if a[i] - a[i - 1] > x:
			v.append((a[i] - a[i - 1] - 1) // x)
	v.sort(reverse=True)
	while len(v):
		if v[-1] <= k:
			k -= v[-1]
			v.pop()
		else:
			break
	print(len(v) + 1)
main()


I = lambda : map(int, input().split())
(n, k, x) = I()
a = list(I())
a = sorted(a)
p = []
op = 1
for i in range(n - 1):
	dif = a[i + 1] - a[i] - 1
	p.append(int(dif != -1) * (dif // x))
p.sort()
for j in p:
	k = k - j
	if k < 0:
		op = op + 1
		k = 0
print(op)


(n, k, x) = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
cnt = 0
g = 1
d = [a[i + 1] - a[i] for i in range(n - 1) if a[i + 1] - a[i] > x]
d.sort()
ans = len(d) + 1
for i in d:
	s = (i - 1) // x
	if s <= k:
		k -= s
		ans -= 1
print(ans)


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
from collections import *
from collections import deque
from operator import itemgetter, attrgetter
from decimal import *
import bisect
import math
import heapq as hq
MOD = 10 ** 9 + 7

def is_prime(n):
	if n == 2 or n == 3:
		return True
	if n < 2 or n % 2 == 0:
		return False
	if n < 9:
		return True
	if n % 3 == 0:
		return False
	r = int(n ** 0.5)
	f = 5
	while f <= r:
		if n % f == 0:
			return False
		if n % (f + 2) == 0:
			return False
		f += 6
	return True

def pow(a, b, m):
	ans = 1
	while b:
		if b & 1:
			ans = ans * a % m
		b //= 2
		a = a * a % m
	return ans

def ispalindrome(s):
	if s[:] == s[::-1]:
		return 1
	return 0
dp = []
limit = []
v = []

def dpdfs(u, t=-1):
	dp[0][u] = 0
	dp[1][u] = 0
	for i in v[u]:
		if i == t:
			continue
		if dp[1][i] == -1:
			dpdfs(i, u)
		dp[0][u] += max(abs(limit[0][u] - limit[1][i]) + dp[1][i], abs(limit[0][u] - limit[0][i]) + dp[0][i])
		dp[1][u] += max(abs(limit[1][u] - limit[1][i]) + dp[1][i], abs(limit[1][u] - limit[0][i]) + dp[0][i])
vis = []

def dfs(v):
	if vis[v] == 0:
		return
	vis[v] = 0
	for vv in g[v]:
		dfs(vv)
(n, k, x) = map(int, input().split())
l = list(map(int, input().split()))
l.sort()
temp = []
for i in range(1, n):
	y = (l[i] - l[i - 1] + x - 1) // x - 1
	if y > 0:
		temp.append(y)
temp.sort()
ans = len(temp) + 1
for i in range(len(temp)):
	if temp[i] <= k:
		k -= temp[i]
		ans -= 1
	else:
		break
	if k <= 0:
		break
print(ans)


import sys
MOD = 1000000007
no = lambda : print('NO')
yes = lambda : print('YES')
_1 = lambda : print(-1)
ari = lambda : [int(_) for _ in input().split()]
cin = lambda : int(input())
cis = lambda : input()
show = lambda x: print(x)
test_case = 1

def ans():
	(n, k, x) = ari()
	a = ari()
	a.sort()
	cnt = 1
	ss = []
	for i in range(1, n):
		if a[i] - a[i - 1] > x:
			dodo = a[i] - a[i - 1]
			intial = (dodo - 1) // x
			ss.append(intial)
	ss.sort()
	for i in ss:
		if i <= k:
			k = k - i
		else:
			cnt += 1
	show(cnt)
	return
for _ in range(test_case):
	ans()


def stable_groups():
	(n, k, x) = map(int, input().split())
	nums = list(map(int, input().split()))
	count = 0
	corres = []
	nums.sort()
	for i in range(1, n):
		if nums[i] - nums[i - 1] > x:
			count += 1
			if (nums[i] - nums[i - 1]) % x == 0:
				corres.append((nums[i] - nums[i - 1]) // x - 1)
			else:
				corres.append((nums[i] - nums[i - 1]) // x)
	count += 1
	corres.sort()
	for num in corres:
		if num > k or k == 0:
			break
		else:
			k -= num
			count -= 1
	print(count)
stable_groups()


(n, k, x) = map(int, input().split())
(a, mem) = (sorted([int(x) for x in input().split()]), [])
for i in range(1, n):
	diff = a[i] - a[i - 1]
	if diff > x:
		mem.append((diff - 1) // x)
mem.sort(reverse=True)
while mem and mem[-1] <= k:
	k -= mem.pop()
print(len(mem) + 1)


from collections import Counter
from collections import defaultdict as dfd
from bisect import bisect, bisect_left
from math import sqrt, gcd, ceil, factorial
from heapq import heapify, heappush, heappop
MOD = 10 ** 9 + 7
inf = float('inf')
ans_ = []

def nin():
	return int(input())

def ninf():
	return int(file.readline())

def st():
	return input().strip()

def stf():
	return file.readline().strip()

def read():
	return list(map(int, input().strip().split()))

def readf():
	return list(map(int, file.readline().strip().split()))

def f(n, x):
	return n // x

def solve():
	(n, k, x) = read()
	arr = read()
	cuts = []
	arr.sort()
	for i in range(n - 1):
		if arr[i + 1] - arr[i] > x:
			cuts.append(arr[i + 1] - arr[i] - 1)
	cuts.sort()
	ans = len(cuts) + 1
	for i in cuts:
		need = f(i, x)
		if k >= need:
			ans -= 1
			k -= need
	ans_.append(ans)
solve()
for i in ans_:
	print(i)


(n, k, x) = map(int, input().split())
a = sorted(map(int, input().split()))
dl = []
c = 1
for i in range(1, n):
	temp = a[i] - a[i - 1]
	if temp > x:
		dl.append((temp - 1) // x)
		c += 1
dl.sort()
for i in dl:
	if k < i:
		break
	else:
		k -= i
		c -= 1
print(c)


from math import ceil
from collections import defaultdict
(n, k, x) = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
y = []
carry = a[0]
w = k
l = 1
for s in a[1:]:
	o = ((s - carry) // x - 1) * ((s - carry) % x == 0) + (s - carry) // x * ((s - carry) % x != 0)
	if o > 0:
		y.append(o)
		l += 1
	carry = s
y.sort()
d = 0
for e in y:
	k -= e
	if k < 0:
		r = (k + e) // e
		d += r
		break
	d += 1
print(l - d)


(n, k, x) = map(int, input().split(' '))
A = list(map(int, input().split(' ')))
A.sort()
D = [A[i] - A[i - 1] for i in range(1, len(A))]
count = 1
for d in D:
	if d > x:
		count += 1
D.sort()
for d in D:
	if d > x:
		add = max((d + x - 1) // x - 1, 1)
		if k >= add:
			count -= 1
			k -= add
print(count)


R = lambda : map(int, input().split())
(n, k, x) = R()
a = sorted(list(R()))
b = []
for i in range(1, n):
	t = a[i] - a[i - 1]
	if t > x:
		b += [(t - 1) // x]
b = sorted(b)

def solve(k, groups):
	ans = groups
	if groups == 1:
		return 1
	for i in range(groups - 1):
		if k >= b[i]:
			k -= b[i]
			ans -= 1
		else:
			return ans
	return 1
print(solve(k, len(b) + 1))


(n, k, x) = map(int, input().split())
l = list(map(int, input().split()))
l.sort()
c = 0
v = []
for i in range(1, n):
	if l[i] - l[i - 1] > x:
		if (l[i] - l[i - 1]) % x:
			v.append((l[i] - l[i - 1]) // x)
		else:
			v.append((l[i] - l[i - 1]) // x - 1)
		c += 1
c += 1
v.sort()
for i in range(len(v)):
	if v[i] <= k:
		c -= 1
		k -= v[i]
	else:
		break
print(c)


def func():
	(x, y, z) = map(int, input().split())
	a = list(map(int, input().split()))
	i = 0
	ans = x
	a.sort()
	b = []
	for i in range(x - 1):
		b.append(a[i + 1] - a[i] - z)
	b.sort()
	for i in range(x - 1):
		if b[i] > 0:
			if y >= (b[i] + z - 1) // z:
				y -= (b[i] + z - 1) // z
				ans -= 1
		else:
			ans -= 1
	print(ans)
func()


(n, k, x) = map(int, input().split())
l = list(map(int, input().split()))
l.sort()
p = []
cnt = 0
for i in range(1, len(l)):
	if l[i] - l[i - 1] > x:
		p.append((l[i] - l[i - 1] - 1) // x)
p.sort()
p.reverse()
while len(p):
	if p[len(p) - 1] <= k:
		k -= p[len(p) - 1]
		p.pop()
	else:
		break
print(len(p) + 1)


import os
import sys
from io import BytesIO, IOBase
from collections import Counter
import math as mt
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))

def gcd(a, b):
	if a == 0:
		return b
	return gcd(b % a, a)

def lcm(a, b):
	return a * b / gcd(a, b)
mod = int(1000000000.0) + 7

def power(k, n):
	if n == 0:
		return 1
	if n % 2:
		return power(k, n - 1) * k % mod
	t = power(k, n // 2)
	return t * t % mod

def totalPrimeFactors(n):
	count = 0
	if n % 2 == 0:
		count += 1
		while n % 2 == 0:
			n //= 2
	i = 3
	while i * i <= n:
		if n % i == 0:
			count += 1
			while n % i == 0:
				n //= i
		i += 2
	if n > 2:
		count += 1
	return count

def main():
	(n, k, x) = map(int, input().split())
	a = list(map(int, input().split()))
	t = []
	ans = 1
	a.sort()
	for i in range(1, n):
		if a[i] - a[i - 1] > x:
			t.append(a[i] - a[i - 1] - 1)
			ans += 1
	t.sort()
	for i in t:
		if i // x <= k:
			ans -= 1
			k -= i // x
	print(ans)
	return
main()


import sys
input = sys.stdin.readline

def main():
	(n, k, x) = map(int, input().split())
	alst = list(map(int, input().split()))
	alst.sort()
	ans = 1
	lst = []
	bef = alst[0]
	for a in alst[1:]:
		d = a - bef
		if d > x:
			ans += 1
			lst.append((d - 1) // x)
		bef = a
	lst.sort()
	lst += [10 ** 50]
	for l in lst:
		if l <= k:
			k -= l
			ans -= 1
		else:
			break
	print(ans)
for _ in range(1):
	main()


from decimal import Decimal
from math import ceil
(n, k, x) = map(int, input().split())
a = sorted([int(x) for x in input().split()])
b = []
for i in range(1, n):
	if a[i] - a[i - 1] > x:
		b.append(ceil(Decimal(a[i] - a[i - 1]) / x) - 1)
b.sort()
s = 0
ans = len(b) + 1
for x in b:
	if s + x <= k:
		ans -= 1
		s += x
print(ans)


import sys
input = sys.stdin.readline
(n, k, y) = map(int, input().split())
ar = list(map(int, input().split()))
ar.sort()
a = []
s = 1
for x in range(1, n):
	if ar[x - 1] == ar[x]:
		continue
	b = (ar[x] - ar[x - 1] - 1) // y
	a.append(b)
a.sort()
for x in range(len(a)):
	if k >= a[x]:
		k -= a[x]
	else:
		s += 1
print(s)


(n, k, x) = map(int, input().split())
l = list(map(int, input().split()))
l.sort()
d = []
for j in range(1, n):
	if l[j] == l[j - 1]:
		continue
	b = (l[j] - l[j - 1] - 1) // x
	d.append(b)
d.sort()
ans = 1
for j in range(len(d)):
	b = d[j]
	if k >= b:
		k -= b
	else:
		ans += 1
print(ans)


from sys import *
from collections import Counter
from itertools import permutations
input = lambda : stdin.readline()
int_arr = lambda : list(map(int, stdin.readline().strip().split()))
str_arr = lambda : list(map(str, stdin.readline().split()))
get_str = lambda : map(str, stdin.readline().strip().split())
get_int = lambda : map(int, stdin.readline().strip().split())
get_float = lambda : map(float, stdin.readline().strip().split())
mod = 1000000007
setrecursionlimit(1000)
(n, k, d) = get_int()
arr = int_arr()
arr.sort()
new = []
ct = 1
for i in range(len(arr) - 1):
	if arr[i + 1] - arr[i] > d:
		ct += 1
		new.append(arr[i + 1] - arr[i])
new.sort()
for i in new:
	diff = (i - 1) // d
	if k >= diff:
		ct -= 1
		k -= diff
	else:
		break
print(ct)


import sys
(n, k, x) = map(int, sys.stdin.readline().split())
data = list(map(int, sys.stdin.readline().split()))
data.sort()
cnt = 0
temp = []
for i in range(len(data) - 1):
	if data[i + 1] - data[i] > 0:
		temp.append((data[i + 1] - data[i] - 1) // x)
		cnt += (data[i + 1] - data[i] - 1) // x
ans = 1
temp.sort()
while cnt > k:
	cnt -= temp.pop()
	ans += 1
print(ans)


from sys import stdin, stdout
from heapq import heapify, heappush, heappop

def mapinput():
	return map(int, stdin.readline().split())

def strinput():
	return stdin.readline().strip()

def listinput():
	return list(map(int, stdin.readline().split()))

def intinput():
	return int(stdin.readline().strip())

def solve():
	(n, k, x) = mapinput()
	arr = listinput()
	arr.sort()
	bridge = []
	for i in range(1, n):
		if arr[i] - arr[i - 1] > x:
			bridge.append(arr[i] - arr[i - 1])
	ans = len(bridge) + 1
	bridge.sort()
	for i in range(len(bridge)):
		bridgei = bridge[i]
		stu = (bridgei - 1) // x
		if k - stu >= 0:
			ans -= 1
			k -= stu
		else:
			break
	print(ans)
solve()


import math
import re
(n, k, x) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
c = 0
a.sort()
d = []
i = 1
while i < n:
	if a[i] - a[i - 1] > x:
		d.append(a[i] - a[i - 1] - 1)
	i = i + 1
d.sort()
i = 0
c = len(d) + 1
while i < len(d) and k > 0:
	k = k - d[i] // x
	i = i + 1
	if k >= 0:
		c = c - 1
print(c)


(n, k, x) = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
l = []
for i in range(1, len(a)):
	d = a[i] - a[i - 1]
	if d <= x:
		continue
	l.append((d - 1) // x)
l.sort()
ans = len(l) + 1
for y in l:
	if k >= y:
		k -= y
		ans -= 1
print(ans)


(n, k, x) = map(int, input().split())
y = list(sorted(map(int, input().split())))
l = []
for i in range(1, n):
	if y[i] - y[i - 1] > x:
		l.append((y[i] - y[i - 1] - 1) // x)
l.sort()
p = 0
for i in l:
	if i <= k:
		k -= i
		p += 1
	else:
		break
print(len(l) + 1 - p)


from heapq import heapify, heappop, heappush

def main():
	(n, k, x) = map(int, input().split())
	A = list(map(int, input().split()))
	A.sort()
	HQ = []
	for i in range(len(A) - 1):
		d = A[i + 1] - A[i]
		num = (d - 1) // x
		if num > 0:
			heappush(HQ, num)
	while HQ:
		if k >= HQ[0]:
			k -= HQ[0]
			heappop(HQ)
		else:
			break
	ans = len(HQ)
	print(ans + 1)
main()


l1 = [int(i) for i in input().split(' ')]
n = l1[0]
k = l1[1]
x = l1[2]
a = [int(i) for i in input().split(' ')]
a.sort()
gaps = []
ans = 1
for i in range(n - 1):
	if a[i + 1] - a[i] > x:
		gaps.append((a[i + 1] - a[i] - 1) // x)
gaps.sort()
for i in range(len(gaps)):
	if k >= gaps[i]:
		k -= gaps[i]
	else:
		ans += 1
print(ans)


from math import *
from collections import defaultdict as dt
from sys import stdin
inp = lambda : stdin.readline().strip()
I = lambda : int(inp())
M = lambda : map(int, inp().split())
L = lambda : list(M())
mod = 1000000007
inf = 100000000000000000000
ss = 'abcdefghijklmnopqrstuvwxyz'

def solve():
	(n, k, x) = M()
	a = L()
	a.sort()
	b = []
	for i in range(1, n):
		if a[i] - a[i - 1] > x:
			b.append(a[i] - a[i - 1])
	b.sort()
	c = len(b) + 1
	for i in b:
		d = i // x
		if i % x == 0:
			d = d - 1
		if d <= k:
			c = c - 1
			k = k - d
		else:
			break
	print(c)
tt = 1
for _ in range(tt):
	solve()


(n, k, x) = map(int, input().split())
sch = list(map(int, input().split()))
sch = sorted(sch)
ans = 1
intrvl = []
for i in range(1, n):
	if sch[i] - sch[i - 1] > x:
		ans += 1
		dist = sch[i] - sch[i - 1] - 1
		rsch = dist // x
		intrvl.append(rsch)
intrvl = sorted(intrvl, reverse=True)
while intrvl and intrvl[-1] <= k:
	k -= intrvl.pop()
	ans -= 1
print(ans)


import io, os, sys, math
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
(n, k, x) = map(int, input().split())
l = sorted(map(int, input().split()))
dd = []
for i in range(n - 1):
	el1 = l[i]
	el2 = l[i + 1]
	t = abs(el2 - el1)
	if t > x:
		if t % x == 0:
			kkk = t // x - 1
		else:
			kkk = t // x
		dd.append(kkk)
dd.sort()
kk = k
c = 0
f = True
for i in range(len(dd)):
	el = dd[i]
	c += el
	if c > kk:
		ccc = len(dd) - 1 - i + 1
		ans = ccc + 1
		f = False
		break
if f:
	print(1)
else:
	print(ans)


def main():
	(n, k, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	j = []
	p = a[0]
	for i in a[1:]:
		if i - p > x:
			d = (i - p - 1) // x
			j.append(d)
		p = i
	j.sort()
	r = 0
	for i in j:
		if i > k:
			break
		else:
			k -= i
			r += 1
	print(1 + len(j) - r)
main()


(n, k, x) = map(int, input().split())
s = sorted(list(map(int, input().split())))
arr = []
for i in range(1, n):
	d = s[i] - s[i - 1]
	if d > x:
		arr.append(d)
l = len(arr)
arr.sort()
for i in arr:
	a = (i - 1) // x
	if a <= k:
		k -= a
		l -= 1
	else:
		break
print(l + 1)


(n, k, x) = list(map(int, input().split()))
arr = list(map(int, input().split()))
arr.sort()
groups = 1
re = []
for i in range(n - 1):
	diff = arr[i + 1] - arr[i]
	if diff > x:
		if x == 0:
			groups += 1
			continue
		if diff % x == 0:
			diff = diff // x - 1
		else:
			diff = diff // x
		re.append(diff)
		groups += 1
re.sort()
for i in range(len(re)):
	k -= re[i]
	if k >= 0:
		groups -= 1
	else:
		break
print(groups)


import math
import sys
input = sys.stdin.buffer.readline
(n, k, x) = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
R = []
for i in range(n - 1):
	if A[i + 1] - A[i] > x:
		R.append((A[i + 1] - A[i] - 1) // x)
R.sort()
ans = 0
for i in R:
	if i > k:
		break
	else:
		k -= i
		ans += 1
print(len(R) - ans + 1)


def main():
	(n, k, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())))
	spa = []
	for i in range(1, n):
		if a[i] - a[i - 1] > x:
			spa.append(a[i] - a[i - 1])
	spa.sort()
	ans = len(spa)
	for i in spa:
		if (i - 1) // x <= k:
			k -= (i - 1) // x
			ans -= 1
		else:
			break
	print(ans + 1)
main()


(n, k, x) = map(int, input().split())
a = list(map(int, input().split()))
ans = 1
if n > 1:
	a.sort()
	distances = list()
	for i in range(1, n):
		d = a[i] - a[i - 1]
		if d > x:
			distances.append(d)
	distances.sort()
	ans = len(distances) + 1
	i = 0
	while k > 0 and i < len(distances):
		k -= distances[i] // x
		if distances[i] % x == 0:
			k += 1
		if k >= 0:
			ans -= 1
		i += 1
print(ans)


import sys
input = sys.stdin.readline

def solve():
	(n, k, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	if n == 1:
		return 1
	arr.sort()
	ans = 1
	diffs = []
	for i in range(n - 1):
		if arr[i + 1] - arr[i] > x:
			ans += 1
			diffs.append(arr[i + 1] - arr[i])
	if not diffs:
		return ans
	diffs.sort()
	m = len(diffs)
	for j in range(m):
		v = diffs[j] // x
		if diffs[j] % x == 0:
			v -= 1
		if k - v >= 0:
			ans -= 1
			k -= v
		else:
			break
	return ans
print(solve())


import heapq

def solve(n, k, x, arr):
	c = 1
	arr.sort()
	h = []
	heapq.heapify(h)
	for i in range(1, n):
		if arr[i] - arr[i - 1] > x:
			c += 1
			heapq.heappush(h, arr[i] - arr[i - 1])
	if k == 0:
		return c
	else:
		while k > 0 and h:
			temp = heapq.heappop(h)
			q = temp // x
			r = temp % x
			if q and r == 0 and (q - 1 <= k):
				k -= q - 1
				c -= 1
			elif q and r != 0 and (q <= k):
				k -= q
				c -= 1
			else:
				break
	return c
(n, k, x) = map(int, input().split())
arr = list(map(int, input().split()))
if n == 1:
	print(1)
else:
	print(solve(n, k, x, arr))


(n, k, x) = map(int, input().split())
l = list(map(int, input().split()))
l.sort()
v = 1
l1 = []
for j in range(1, n):
	if l[j] == l[j - 1]:
		continue
	b = (l[j] - l[j - 1] - 1) // x
	l1.append(b)
l1.sort()
for j in range(len(l1)):
	b = l1[j]
	if k >= b:
		k -= b
	else:
		v += 1
print(v)


from sys import stdin, stdout
import math, bisect, heapq
from collections import Counter, deque, defaultdict
L = lambda : list(map(int, stdin.readline().strip().split()))
I = lambda : int(stdin.readline().strip())
S = lambda : stdin.readline().strip()
C = lambda : stdin.readline().strip().split()

def pr(a):
	return ''.join(list(map(str, a)))

def solve():
	(n, k, x) = L()
	a = L()
	b = []
	a.sort()
	ans = 0
	for i in range(1, n):
		if a[i] - a[i - 1] > x:
			ans += 1
			b += [(a[i] - a[i - 1] - 1) // x]
	b.sort()
	for i in b:
		if k == 0:
			break
		if k >= i:
			ans -= 1
			k -= i
	print(ans + 1)
for _ in range(1):
	solve()


from math import ceil
from decimal import *
(guys, add_guys, max_diff) = map(int, input().split())
arr = sorted(list(map(int, input().split())))
diff_arr = list()
for ind in range(1, guys):
	if arr[ind] - arr[ind - 1] > max_diff:
		our_num = Decimal((Decimal(arr[ind]) - Decimal(arr[ind - 1])) / Decimal(max_diff))
		our_num = ceil(Decimal(our_num)) - 1
		diff_arr.append(our_num)
diff_arr = sorted(diff_arr)
ans = len(diff_arr) + 1
for ind in range(0, len(diff_arr)):
	if add_guys - diff_arr[ind] >= 0:
		add_guys -= diff_arr[ind]
		ans -= 1
	else:
		break
print(ans)


from math import ceil
(n, k, x) = [int(v) for v in input().split()]
w = [int(v) for v in input().split()]
res = []
w.sort()
for j in range(1, n):
	if w[j] - w[j - 1] > x:
		res.append((w[j] - w[j - 1]) // x - int(bool((w[j] - w[j - 1]) % x == 0)))
res.sort(reverse=True)
while res and res[-1] <= k:
	k -= res.pop()
print(len(res) + 1)


(n, k, x) = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
s = 1
ch = k
b = []
for i in range(1, n):
	j = a[i] - a[i - 1]
	if j > x:
		p = (j - 1) // x
		if p > k:
			s = s + 1
		else:
			b.append(p)
b.sort()
d = len(b)
for i in range(0, len(b)):
	if b[i] <= ch:
		ch = ch - b[i]
	else:
		d = i
		break
s = s + len(b) - d
print(s)


soso = lambda : map(int, input().split())
s = sorted
(n, k, x) = soso()
a = s(soso())
for u in s((max(v - u, x) for (u, v) in zip(a, a[1:]))):
	k += -u // x + 1
	if k < 0:
		break
	n -= 1
print(n)


from sys import stdin as inp
(n, k, x) = map(int, inp.readline().split())
arr = list(map(int, inp.readline().split()))
arr.sort()
tot = 0
v = []
for i in range(1, n):
	if arr[i] - arr[i - 1] > x:
		tot += 1
		v.append(arr[i] - arr[i - 1])
v.sort()
tot += 1
for i in v:
	t = (i - 1) // x
	if t <= k:
		k -= t
		tot -= 1
	else:
		break
print(tot)


(n, k, x) = map(int, input().split())
a = sorted([int(s) for s in input().split()])
b = []
count = 1
for i in range(1, n):
	if a[i] - a[i - 1] > x:
		b.append(a[i] - a[i - 1])
		count += 1
for i in range(len(b)):
	if b[i] % x == 0:
		b[i] = b[i] // x - 1
	else:
		b[i] = b[i] // x
b.sort()
for i in b:
	k -= i
	if k >= 0:
		count -= 1
print(count)


(n, k, x) = map(int, input().split())
a = sorted(list(map(int, input().split())))
b = []
ans = 1
for i in range(1, n):
	t = a[i] - a[i - 1]
	if t > x:
		ans += 1
		b.append((t - 1) // x)
b.sort()
for i in b:
	if k >= i:
		k -= i
		ans -= 1
	else:
		break
print(ans)


inp = input().split()
n = int(inp[0])
permit = int(inp[1])
x = int(inp[2])
arr = []
inp = input().split()
for i in inp:
	arr.append(int(i))
arr.sort()
split = []
group = 1
for i in range(1, len(arr)):
	if arr[i] - arr[i - 1] > x:
		split.append([i - 1, i])
		group += 1
split.sort(key=lambda x: arr[x[1]] - arr[x[0]])
count = 0
for i in split:
	go = arr[i[1]] - arr[i[0]]
	if go % x == 0:
		go = go // x - 1
	else:
		go = go // x
	if permit >= go:
		permit -= go
		count += 1
	else:
		break
	if permit == 0:
		break
print(group - count)


import sys
input = sys.stdin.readline
(n, k, x) = map(int, input().split())
a = sorted(map(int, input().split()))
differences = sorted(filter(lambda x: x > 0, [(a[i] - a[i - 1] - 1) // x for i in range(1, n)]))
ans = len(differences) + 1
for i in differences:
	if i <= k:
		k -= i
		ans -= 1
	else:
		break
print(ans)


def main():
	(n, k, x) = tuple(map(int, input().split()))
	a = list(map(int, input().split()))
	b = []
	a.sort()
	for i in range(1, n):
		h = a[i] - a[i - 1]
		if h > x:
			b += [(h - 1) // x]
	b.sort()
	i = 0
	g = len(b)
	count = 0
	while i < g and k > 0:
		k -= b[i]
		if k >= 0:
			count += 1
		i += 1
	print(g - count + 1)
main()


(n, k, x) = map(int, input().split())
l = list(map(int, input().split()))
l.sort()
c = 0
tt = []
for i in range(n - 1):
	if l[i + 1] - l[i] > x:
		if k > 0:
			gg = (l[i + 1] - l[i] - 1) // x
			tt.append(gg)
		else:
			c += 1
tt.sort()
for i in tt:
	if k > 0:
		if i <= k:
			k -= i
		else:
			c += 1
	else:
		c += 1
print(c + 1)


import sys
(N, k, x) = map(int, sys.stdin.readline().split(' '))
A = list(map(int, sys.stdin.readline().split()))
A.sort()
gaps = []
for i in range(1, len(A)):
	diff = A[i] - A[i - 1]
	if diff > x:
		gaps.append((diff - 1) // x)
gaps.sort()
groups = len(gaps) + 1
for gap in gaps:
	if gap <= k:
		k -= gap
		groups -= 1
	else:
		break
print(groups)


import bisect
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
y = input().split(' ')
import math
n = int(y[0])
k = int(y[1])
x = int(y[2])
xxx = input().split(' ')
l = [int(xx) for xx in xxx]
l.sort()
ll = []
for i in range(1, len(l)):
	if l[i] - l[i - 1] > x:
		ll.append(l[i] - l[i - 1])
ll.sort(reverse=True)

def myfunc(k, ll, x):
	b = 0
	if ll == []:
		return 0
	j = 1
	while k > 0 and b != len(ll):
		hhh = ll[-j] // x
		if x * hhh == ll[-j]:
			hh = hhh - 1
		else:
			hh = hhh
		if hh <= k:
			k -= hh
			j += 1
			b += 1
		else:
			break
	return b
v = myfunc(k, ll, x)
print(len(ll) - v + 1)


import math

def solve():
	(n, k, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	v = []
	for i in range(n - 1):
		if a[i + 1] - a[i] > x:
			avg = (a[i + 1] + a[i]) // 2
			if a[i + 1] - avg > x or avg - a[i] > x:
				m = (a[i + 1] - a[i]) // x - 1
				if a[i + 1] - (m * x + a[i]) > x:
					m += 1
			else:
				m = 1
			v.append(m)
	v.sort()
	for i in range(len(v)):
		if k - v[i] >= 0:
			k -= v[i]
		else:
			return len(v) - i + 1
	return 1
print(solve())


from decimal import *
import math

def minSplit(arr, n, k, x):
	arr.sort()
	pre = arr[0]
	res = []
	for i in range(1, len(arr)):
		if arr[i] - pre > x:
			res.append(arr[i] - pre)
		pre = arr[i]
	res.sort(reverse=True)
	while k > 0 and len(res):
		val = res.pop()
		need = math.ceil(Decimal(val) / Decimal(x)) - 1
		if need <= k:
			k -= need
		else:
			res.append(val)
			break
	return len(res) + 1
(n, k, x) = map(int, input().split())
arr = list(map(int, input().split()))
print(minSplit(arr, n, k, x))


(n, k, xx) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
a.sort()
c = 1
l = []
for i in range(1, n):
	if a[i] - a[i - 1] <= xx:
		continue
	diff = a[i] - a[i - 1]
	needed = diff // xx
	if diff % xx == 0:
		needed -= 1
	l.append(needed)
l.sort()
for i in range(len(l)):
	if k >= l[i]:
		k -= l[i]
	else:
		c += 1
print(c)