#include <fstream>
#include <algorithm>
#include <math.h>
using namespace std;
int main()
{
	int n,m,x,i,o=1,c=0; double a[1001],k,b[1001];
	ifstream in("mark.in");
	ofstream out("mark.out");
	in>>n>>m;
	for(i=1;i<=n;i++)in>>a[i];
	in>>x;
	k=n/m;
	sort(a+1,a+n+1);
	for(i=1;i<=n;i++)
	{
		b[i]=o;
		c++;
		if(a[i]==a[i+1])
		{
			b[i+1]=b[i];
			i++;
		}
		if(c==k)
		{
			c=0;o++;
		}
	}
	out<<b[x];
	in.close();
	out.close();
	return 0;
}