inline int jdg(int x,int l){return x<l?x:0;}//判断s[i](t[i])的上一个相同字符是否在匹配范围内//是就返回a[i](b[i])，否就返回0
inline bool eq(int x,int y,int l){return jdg(x,l)==jdg(y,l);}//判断是否匹配

#include<cstdio>
#include<cstring>
#include<algorithm>
#define N (1000000+2)
#define C (1000000+2)
using namespace std;
int p[N];
int a[N],b[N];
int l[C];//这里很重要，我把C开小了交了不知多少次都没有过
int ans[N];
template<typename T>inline void read(T& x){char temp=getchar();bool u=0;for(x=0;temp<'0'||temp>'9';u=temp=='-',temp=getchar());for(;temp>='0'&&temp<='9';x=x*10+temp-'0',temp=getchar());if(u)x=-x;return ;
}//快读
inline int jdg(int x,int l){return x<l?x:0;}//判断s[i](t[i])是否在匹配范围内//是就返回a[i](b[i])，否就返回0
inline bool eq(int x,int y,int l){return jdg(x,l)==jdg(y,l);}//判断是否匹配
void work(){register int i,j,x;register int n,m;read(n);read(m);memset(a,0,sizeof a);memset(b,0,sizeof b);//有多组数据，一定要初始化memset(p,0,sizeof p);//否则就会成为某dengzhaoxing之二memset(l,0,sizeof l);for(i=1;i<=n;i++){read(x);a[i]=i-l[x];//将a[i]赋值为字符x与上一x之间的距离l[x]=i;}memset(l,0,sizeof l);//输入s和t之前都要初始化lfor(i=1;i<=m;i++){read(x);b[i]=i-l[x];//将b[i]赋值为字符x与上一x之间的距离l[x]=i;}for(i=1,j=0;i<m;i++){while(j&&!eq(b[i+1],b[j+1],j+1))j=p[j];if(eq(b[i+1],b[j+1],j+1))j++;p[i+1]=j;}//KMP初始化p数组for(x=i=j=0;i<n;i++){while(j&&!eq(a[i+1],b[j+1],j+1))j=p[j];if(eq(a[i+1],b[j+1],j+1))j++;if(j==m){ans[++x]=i+2-m;j=p[j];}}//KMP匹配printf("%d\n",x);for(i=1;i<=x;i++)printf("%d ",ans[i]);//输出答案putchar('\n');return ;
}
int main(){register int t,c,i;read(t);read(c);for(i=1;i<=t;i++)work();return 0;
}