#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>

#define FORR(i,b,e) for(int i=(b);i<(int)(e);++i)
#define FOR(i,e) FORR(i,0,e)
#define sortuniq(v) sort(v.begin(), v.end()), v.erase(unique(v.begin(),v.end()),v.end())
#define dump(var) cerr << #var ": " << var << "\n"
#define dumpc(con) for(auto& e: con) cerr << e << " "; cerr<<"\n"

typedef long long ll;
typedef unsigned long long ull;

const double EPS = 1e-6;
const int d4[] = {0, -1, 0, 1, 0};

using namespace std;


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N, M;
    cin >> N >> M;
    vector<int> C(N);
    FOR(i, N) cin >> C[i];

    sort(C.begin(), C.end());
    int ans = -1, c  =0, cp = 0;
    FOR(i, N) {
        c += (C[i]-cp-1) * (N-i);
        cerr << M << "==" << c << '[' << i << ']' << '\n';
        if (M < c) {
            ans = i;
            break;
        }
        c += N - i;
        cerr << M << "==" << c << '\n';
        cp = C[i];
    }
    if (ans == -1) ans = N;
    cout << ans << endl;

    return 0;
}