#include<iostream>
#include<cstdio>
using namespace std;
const int N=1e6;
const int M=10000+5;
int a[N],b[M];
int n,m;
void GetNext(int next[])
{
next[0] = -1;
int k = -1;
int j = 0;
while (j < m)
{
//b[k]表示前缀,b[j]表示后缀
if (k == -1 || b[k]==b[j])
{
++k;
++j;
next[j] = k;
}
else
{
k = next[k];
}
}
}
int KmpSearch(int next[])
{
int i = 0;
int j = 0;
while (i < n && j < m)
{
//①如果j = -1,或者当前字符匹配成功(即S[i] == P[j]),都令i++,j++
if (j == -1 || a[i] == b[j])
{
i++;
j++;
}
else
{
//②如果j != -1,且当前字符匹配失败(即S[i] != P[j]),则令 i 不变,j = next[j]
//next[j]即为j所对应的next值
j = next[j];
}
}
if (j == m)
return i - j+1;
else
return -1;
}
int main()
{
int T;
while(scanf("%d",&T)==1&&T)
{
while(T--)
{
int next[M];
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
for(int i=0;i<m;i++)
scanf("%d",&b[i]);
GetNext(next);
cout<<KmpSearch(next)<<endl;
}
}
return 0;
}