#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int n,m,x;
struct D{
	int v,id;
	bool operator < (const D& rhs) const{
		return v > rhs.v;
	}
}a[1010];

int main(){
	#ifndef DEBUG
		string FileName="mark";
		freopen((FileName+".in").c_str(),"r",stdin);
		freopen((FileName+".out").c_str(),"w",stdout);
	#endif
	scanf("%d%d",&n,&m);
	for(int i = 1; i <= n; i++)scanf("%d",&a[i].v),a[i].id=i;
	scanf("%d",&x);
	sort(a+1,a+n+1);
	int pos;
	for(int i = 1; i <= n; i++){
		if(a[i].id == x){
			pos = i;
			break;
		}
	}
	int size = n/m;
	printf("%d",(int)(pos/size));
}