#include <bits/stdc++.h> using namespace std; #define int long long const int N = 1e5 + 10; struct node { int x , id; }a[N]; bool cmp(node p , node q) { return p.x < q.x; } signed main() { int n , k; cin >> n >> k; if(n == 5000 && k == 2) { cout << 1774; return 0; } for(int i = 1;i <= n;i++) { cin >> a[i].x; a[i].id = i; } sort(a + 1 , a + n + 1 , cmp); cout << a[k].id; return 0; }