// author: cody

#include <bits/stdc++.h>

using namespace std;

long long a[100000];

void sort(int l, int r) {
    int i = l;
    int j = r;
    long long x = a[(l + r) / 2];
    do {
        while (a[i] < x) 
            i++;
        while (x < a[j]) 
            j--;
        if (!(i > j)) {
            swap(a[i], a[j]);
            i++;
            j--;
        }
    } while (i <= j);
    if (l < j) 
        sort(l, j);
    if (i < r) 
        sort(i, r);
}

int main() {
    freopen("findnewpos.inp" , "r", stdin);
    freopen("findnewpos.out" , "w", stdout);
    long long n, k, t, d = 0;
    cin >> n >> k;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    t = a[k];
    for (int i = 1; i <= n; i++) {
        if (a[i] == t && i == k) 
            break;
        else if (a[i] == t && i < k) 
            d++;
    }
    sort(1, n);
    for (int i = 1; i <= n; i++) {
        if (a[i] == t) {
            cout << i + d;
            return 0;
        }
    }
    return 0;
}