#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<queue>
#include<cmath>
#include<map>
#include<vector>
#include<cstring>
#include<set>
using namespace std;
const int maxn=1005;
int n,m,x,sum,temp;
struct date{
	int num,score;
}a[maxn];
bool cmp(const date& u,const date& v){
	return u.score>v.score;
}
int main(){
	freopen("mark.in","r",stdin);
	freopen("mark.out","w",stdout);
	scanf("%d%d",&n,&m);
	int i,j,d;
	for(i=1;i<=n;i++){
		scanf("%d",&a[i].score);
		a[i].num=i;
	}
	scanf("%d",&x);
	sort(a+1,a+1+n,cmp);
	a[0].score=0;
	d=n/m;
	sum=1;
	for(i=1;i<=n;i++){
		if(a[i].score!=a[i+1].score)
			temp++;
		if(a[i].num==x)
			break;
		if(temp==d){
			sum++;
			temp=0;
		}
		
	}
	printf("%d\n",sum);
	fclose(stdin);
	fclose(stdout);
	return 0;
}
/*
3 3
632
651
624
3

3
*/