#include <iostream> #include <algorithm> using namespace std; int a[1000100], original[1000100]; int main() { int n, k; cin >> n >> k; for(int i = 1; i <= n; i++) {cin >> a[i]; original[i] = a[i];} sort(a + 1, a + n + 1); for(int i = 1; i <= n; i++) if(original[i] == a[k]) {cout << i << endl; return 0;} return 0; }