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

int main()
{
	int N, K;
	cin >> N >> K;
	vector<int> p( N );
	for( int i = 0; i < N; i++ ) cin >> p[i];

	int l = -1;
	int h = 1000;
	int ans = 0;
	while( h - l > 1 ) {
		int m = (l + h) / 2;
		int c = 0;
		for( int i = 0; i < N; i++ ) if( p[i] >= m ) c++;
		if( c <= K ) {
			h = m;
			ans = max( ans, c );
		}
		else l = m;
	}

	cout << ans << endl;
}