#include <fstream>
#include <algorithm>
#include <set>
using namespace std;
ifstream cin("zebughil.in");
ofstream cout("zebughil.out");
multiset<int> s;
int q,b,g,i,v[20],z,n;
int main()
{
    q=3;
    while(q--)
    {
        cin>>n>>g;
        for(i=1;i<=n;i++)
        {
            cin>>v[i];
        }
        sort(v+1,v+n+1,greater<int>());
        s.insert(-v[1]);
        for(i=2;i<=n;i++)
        {
            z=0;
            for(auto x:s)
            {
                if(v[i]-x<=g)
                {
                    z=x;
                    break;
                }
            }
            if(z==0) s.insert(-v[i]);
            else
            {
                s.erase(s.find(z));
                s.insert(-(v[i]-z));
            }
        }
        cout<<s.size()<<'\n';
        s.clear();
    }
    return 0;
}