#include<iostream>
    #include<cstdio>
    #include<algorithm>
    #include<cstring>
    using namespace std;
    int n,m;
    class node{
    public:
    int bh;
    int cj;
    int jh;
    }a[1005]={0};
    int lll(const node a,const node b)
    {
    if(a.cj>b.cj)
    return 1;
    if(a.cj<b.cj)
    return 0;
    return 0;
    }
    int wjh()
    {
    freopen("mark.in","r",stdin);
    freopen("mark.out","w",stdout);
    cin>>n>>m;
    int p,x,rr;
    p=n/m;
    for(int i=1;i<=n;i++)
    {
    cin>>a[i].cj;
    a[i].bh=i;
    }
    sort(a+1,a+n+1,lll);
    for(int i=1;i<=n;i++)
    a[i].jh=i;
    cin>>x;
    for(int i=1;i<=n;i++)
    {
    if(a[i].bh==x)
    rr=a[i].jh;
    }
    while(rr%p!=0)
    rr++;
    cout<<rr/p;
    return 0;
    }
	int W=wjh();
	int main()
	{;}