#include<bits/stdc++.h>
using namespace std;

#define ll long long

int a[10000001],n,l;

bool find_pd(int mid)
{
	ll tag = 0;
	for(int i = 1;i <= n;i++)
	{
		tag += a[i] / l;
	}
	return mid >= n;
}

int find(int p)
{
	int l = 1,r = n,ans = 0;
	while (l <= r)
	{
		int mid = (l + r) / 2;
		if (find_pd(mid)){l = mid + 1;ans = mid;}
		else r = mid - 1;
	}
		return ans;
		
}
int main()
{
	cin >> n >> l;
	for(int i = 1;i <= n;i++)
	{
		cin >> a[i];
	}
	cout << find(l);
	return 0;
}