//1711 Number Sequence (KMP算法)
#include<iostream>
#include<cstdio>
using namespace std;
const int N=1000009;
const int M=10009;
int sum[N];
int su[M];
int n,m;
int next[M];
void build_next()
{
int i;
int j=0;
for(i=2;i<=m;i++)
{
while(j>0&&su[j+1]!=su[i])
{
j=next[j];
}
if(su[j+1]==su[i]) j++;
next[i]=j;
}
}
int KMP_search()
{
int r=-1;
int i;
int j=0;
for(i=1;i<=n;i++)
{
while(j>0&&su[j+1]!=sum[i])
{
j=next[j];
}
if(su[j+1]==sum[i])
{
j++;
//=======KMP可变性=====
if(j==m)
{
r=i-m+1;
break;
}
//=====================
}
}
return r;
}
int main()
{
int t;
cin>>t;
int i;
while(t--)
{
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
{
scanf("%d",&sum[i]);
}
for(i=1;i<=m;i++)
{
scanf("%d",&su[i]);
}
build_next();
printf("%d\n",KMP_search());
}
return 0;
}