http://acm.hdu.edu.cn/showproblem.php?pid=1711
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
const int maxn=10005;
int nextt[maxn],lena,lenb,k;
int a[1000005],b[maxn];
void get_next(){
int j=0;
nextt[0]=-1;
int k=-1;
while(j<lenb-1){
if(k==-1||b[j]==b[k]){
++j; ++k;
if(b[j]==b[k])
nextt[j]=nextt[k];
else nextt[j]=k;
//nextt[j]=k;
}
else k=nextt[k];
}
}
int kmp(){
int i=0,j=0;
while(j<lenb&&i<lena){
if(j==-1||a[i]==b[j]){
++i; ++j;
}
else j=nextt[j];
}
if(j==lenb)
return i-j+1;
else return -1;
}
int main(){
int n;
scanf("%d",&n);
while(n--){
memset(nextt,0,sizeof(nextt));
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
scanf("%d %d",&lena,&lenb);
for(int i=0;i<lena;i++)
scanf("%d",&a[i]);
for(int i=0;i<lenb;i++)
scanf("%d",&b[i]);
get_next();
k=0;
printf("%d\n",kmp());
}
return 0;
}