#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
    int n,m;cin>>n>>m;
    vector<int> A(n);
    for(int i = 0; n > i; i++){
        cin>>A[i];
    }
    sort(A.begin(),A.end());
    for(int i = n-m; n > i;i++){
        if(i==0){
            cout << n-i << endl;
            return 0;
        }else if(A[i-1] != A[i]){
            cout << n-i << endl;
            return 0;
        }
    }
    cout << 0 << endl;
}