#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
int n,m,x,xx,y;
int num[1001]={0};
bool cmp(int a,int b)
{
	if(a>=b)
		return true;
	else
		return false;
}
int main()
{
	freopen ("mark.in","r",stdin);
	freopen ("mark.out","w",stdout);
	cin>>n>>m;
	y=n/m;
	for(int i=1;i<=n;i++)
		cin>>num[i];
	cin>>x;
	xx=num[x];
	sort(num+1,num+n+1,cmp);
	for(int i=1;i<=n;i++)
		if(num[i]==xx)
		{
			xx=i;
			break;
		}
	for(int i=1;i<=m;i++)
	{
		int a=(i-1)*y+1,b=i*y;
		if(a<=xx && b>=xx)
		{
			cout<<i;
			return 0;
		}
	}
	return 0;
}