print queue

#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
#define maxsize 150
int a[maxsize];
bool cmp(int x,int y)
{
	return x>y;
}

struct point
{
	int x,y;
}p[150];

int main()
{
	int s,m,n;
	cin>>s;
	
	while(s--)
	{
		cin>>n>>m;
		int i,max1=0;
		queue<point>sq;
		for(i=0;i<n;i++)
		{
			cin>>a[i];
			p[i].x=a[i],p[i].y=i;//结构体存值和下标
			sq.push(p[i]);
		}
		sort(a,a+n,cmp);
		int maxtop=0;
		int num=1;
		while(1)
		{
			point g=sq.front();
			sq.pop();
			if(g.x==a[maxtop]&&g.y!=m)
			{maxtop++,num++;}
			else if(g.x==a[maxtop]&&g.y==m)
				   break;
			else sq.push(g);
		}
		while(!sq.empty())sq.pop();
		cout<<num<<endl;
	}
	return 0;
}