hdoj1711

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
using namespace std;


int a[1000010],b[10010],nextt[10010];
int t,n,m;


void solve(){
int i,j;
nextt[0] = -1;
i = 0;j = -1;
while(i < m){
if(j == -1||b[i] == b[j]){ //这个写外面会超时！
++i; ++j;
nextt[i] = j;
}
else
j = nextt[j];
}
}


int kmp(){
int i,j;
i = 0;j = 0;
while(i < n){
if(j == -1||a[i] == b[j]){
++i; ++j;
if(j >= m){
return i-j+1;
}
}
else
j = nextt[j];
}
return -1;
}






int main(){
scanf("%d",&t);
while(t--){
scanf("%d%d",&n,&m);
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
for(int i = 0;i<n;++i)
scanf("%d",&a[i]);
for(int i = 0;i<m;++i)
scanf("%d",&b[i]);
solve();
int ans = kmp();
cout<<ans<<endl;
}
return 0;
}