#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n, k, ans = 0;
    cin >> n >> k;
    vector<int> v(n);
    for (auto &&i : v) scanf("%d", &i);
    for (int i = 0; i < 500; ++i) {
        int cnt = 0;
        for (int j = 0; j < n; ++j) {
            if(v[j] >= i) cnt++;
        }
        if(cnt <= k) ans = max(ans, cnt);
    }
    cout << ans << "\n";
    return 0;
}