#include<iostream>  
#include<cstdio>
#include<cmath>
#include<cctype>  
#include<cstring>  
#include<algorithm> 
using namespace std;
int n,m;
struct hs
{
    int fen,p,d;
}a[1001];
bool dd(hs a1,hs a2)
{
    return a1.fen>a2.fen;
}
int main(){ 
	freopen("mark.in","r",stdin);        
    freopen("mark.out","w",stdout);      
    cin>>n>>m;
	m=n/m;
	for(int i=1;i<=n;i++)
	{
	    cin>>a[i].fen;
		a[i].d=i;
	}
	int uu;
	cin>>uu;
	sort(a+1,a+1+n,dd);
	for(int i=1;i<=n;i++)
	{
	    if(i%m==0)a[i].p=i/m;
		else a[i].p=i/m+1;
		if(a[i].d==uu)
		{
		    cout<<a[i].p;
			break;
		}
	}
    return 0;
}