#include<bits/stdc++.h>
using namespace std;
using cd = complex<double>;
const double PI = acos(-1);

int reverse(int num, int lg_n) {
    int res = 0;
    for (int i = 0; i < lg_n; i++) {
        if (num & (1 << i))
            res |= 1 << (lg_n - 1 - i);
    }
    return res;
}

void fft(vector<cd> & a, bool invert) {
    int n = a.size();
    int lg_n = 0;
    while ((1 << lg_n) < n)
        lg_n++;

    for (int i = 0; i < n; i++) {
        if (i < reverse(i, lg_n))
            swap(a[i], a[reverse(i, lg_n)]);
    }

    for (int len = 2; len <= n; len <<= 1) {
        double ang = 2 * PI / len * (invert ? -1 : 1);
        cd wlen(cos(ang), sin(ang));
        for (int i = 0; i < n; i += len) {
            cd w(1);
            for (int j = 0; j < len / 2; j++) {
                cd u = a[i+j], v = a[i+j+len/2] * w;
                a[i+j] = u + v;
                a[i+j+len/2] = u - v;
                w *= wlen;
            }
        }
    }

    if (invert) {
        for (cd & x : a)
            x /= n;
    }
}
vector<int> multiply(vector<int> const& a, vector<int> const& b) {
    vector<cd> fa(a.begin(), a.end()), fb(b.begin(), b.end());
    int n = 1;
    while (n < a.size() + b.size())
        n <<= 1;
    fa.resize(n);
    fb.resize(n);

    fft(fa, false);
    fft(fb, false);
    for (int i = 0; i < n; i++)
        fa[i] *= fb[i];
    fft(fa, true);

    vector<int> result(n);
    for (int i = 0; i < n; i++) {
        result[i] = round(fa[i].real());
        if(result[i]!=0)result[i]=1;
    }
    return result;
}
vector<int>pres;
int n,d;
bool check(int ind) {
    vector<int>newn;
    for(int i=0; i<n; i++) {
        if(i!=ind)newn.push_back(pres[i]);
    }
    vector<vector<int> >a;
    for(int x:newn) {
        if(x==0) {
            a.push_back({1});
            continue;
        }
        vector<int>b;
        b.push_back(1);
        for(int i=1; i<x; i++)b.push_back(0);
        b.push_back(1);
        a.push_back(b);
    }
    while(a.size()>1) {
        vector<vector<int> >b;
        for(int i=1; i<a.size(); i+=2) {
            b.push_back(multiply(a[i],a[i-1]));
            while(b.back().size()>0 && b.back().back()==0)b.back().pop_back();
        }
        //if(a.size()%2)b.push_back(a.back());
        a=b;
    }
    for(int i=d-pres[ind]; i<d; i++) {
        if(a[0].size()<=i)return false;
        if(a[0][i])return true;
    }
    return false;
}
int main() {
    freopen("parties.in","r",stdin);
    freopen("parties.out","w",stdout);
    cin>>n>>d;
    for(int i=0; i<n; i++) {
        int x;
        cin>>x;
        pres.push_back(x);
    }
    sort(pres.begin(),pres.end());
    int l=0,r=pres.size();
    while(l+1<r) {
        int mid=(l+r)/2;
        if(!check(mid))l=mid;
        else r=mid;
    }
    cout<<pres.size()-r<<endl;
    return 0;
}