#include<stdio.h>
int fact(int n)
{
if(n<0)
{
return (1/0);
}
else
{
int i,f=1;
for(i=n;i>0;i–)
{
f=f*i;
}
return f;
}
}
int main()
{
int test;
scanf("%d",&test);
while(test–)
{
int yuh,jug;
int x,flag,y,op,count,i,K;
int arr[101],b[100]={0};
flag=0;
count=0;
for(i=0;i<11;i++)
{
scanf("%d",&arr[i]);
}
scanf("%d",&K);
for(i=0;i<11;i++)
{
b[arr[i]]++;
}
for(i=99;i>=0;i–)
{
if(K<0)
{
x=fact(b[i])/(fact(K)*fact(b[i]-K));
printf("%d\n",x);
flag=1;
break;
}
if((count==0)&&(b[i]==K))
{
printf(“1”);
flag=1;
break;
}
if(b[i]>K&&(count==0))
{
yuh=fact(b[i])/(fact(K)*fact(b[i]-K));
flag=1;
printf("%d",yuh);
break;
}
count=count+b[i];
if(count>K)
{
op=b[i];
count=count-b[i];
break;
}
}
if(flag==0)
{
y=K-count;
jug=(fact(op))/(fact(y)*fact(op-y));
printf("%d",jug);
}
printf("\n");
}
}