#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <stack>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
    int n, k; cin>>n>>k;
    int p[200];
    for(int i=0; i<n; i++) cin>>p[i];
    if(k==n){
        cout<<n<<endl;
        return 0;
    }
    sort(p, p+n, greater<int>());
    int t=k-1;
    while(t>=0 && p[k]==p[t]){
        t--;
    }
    cout<<t+1<<endl;
    return 0;
}