2 1
1 1
 4 1
2 2 1 1
 10 1
2 6 3 4 2 4 4 3 2 1
 2 1
999152 999153
 8 1000000
1 1 5 1000000 1000000 2 2 2
 9 2
1 6 1 5 5 8 6 8 7
 15 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
 1 4
8
 10 1
6 3 1 3 6 4 1 3 6 4
 10 1
1 2 3 5 6 8 10 11 9 4
 7 2
1 5 5 8 9 8 8
 2 1000000
1 1000000
 8 2
3 13 9 8 3 13 9 14
 1 1
1
 2 1
1 2

2
 2
 4
 1
 2
 4
 15
 1
 7
 2
 4
 1
 5
 1
 1

n, k = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
a = sorted(a, reverse = True)
eat = [k] * n
i = 1
current = 0
l = len(a)
ans = 1
while (current < l) and (i < l):
	if a[i] < a[current] <= a[i] + eat[current]:
		eat[current] += (a[current] - a[i])
		i += 1
	else:
		i += 1
		current += i
		ans += 1
			

print(ans)
#print(lines)
#f = [True] * n
#ans = 0
#for i in range(n):
#	if f[i]:
#		ans += 1
#		q = [i]
#		head = 0
#		while head != len(q):
#			for j in lines[q[head]]:
#				if f[j]:
#					f[j] = False
#					q.append(j)
#			head += 1
#		#print(q)
#print(ans)
