1 #include<stdio.h>
 2 #include<string.h>
 3 #include<algorithm>
 4 #include<stdlib.h>
 5 //#include<math.h>
 6 //#include<iostream>
 7 using namespace std;
 8
 9 int n,m,T;
10 #define maxn 100011
11 int a[maxn],sa[maxn][30],b[maxn],sb[maxn][30],fail[maxn];
12 bool equal(int* s1,int sa[][30],int x,int* s2,int sb[][30],int y)
13 {
14     int x1=0,x2=0,y1=0,y2=0;
15     for (int i=0;i<s1[x];i++) x1+=sa[x][i]-sa[x-y][i];
16     for (int i=0;i<s2[y];i++) y1+=sb[y][i];
17     x2=sa[x][s1[x]]-sa[x-y][s1[x]],y2=sb[y][s2[y]];
18     return (x1==y1 && x2==y2);
19 }
20 void makef()
21 {
22     fail[1]=fail[2]=1;
23     for (int i=2;i<=m;i++)
24     {
25         int j=fail[i];
26         while (j>1 && !equal(b,sb,i,b,sb,j)) j=fail[j];
27         fail[i+1]=equal(b,sb,i,b,sb,j)?j+1:1;
28     }
29 }
30 int ans[maxn],lans=0;
31 int main()
32 {
33     scanf("%d%d%d",&n,&m,&T);
34     memset(sa[0],0,sizeof(sa[0]));
35     for (int i=1;i<=n;i++)
36     {
37         scanf("%d",&a[i]);
38         for (int j=0;j<26;j++) sa[i][j]=sa[i-1][j];
39         sa[i][a[i]]++;
40     }
41     memset(sb[0],0,sizeof(sb[0]));
42     for (int i=1;i<=m;i++)
43     {
44         scanf("%d",&b[i]);
45         for (int j=0;j<26;j++) sb[i][j]=sb[i-1][j];
46         sb[i][b[i]]++;
47     }
48     makef();
49     int j=1;
50     for (int i=1;i<=n;i++)
51     {
52         while (j>1 && !equal(a,sa,i,b,sb,j)) j=fail[j];
53         if (equal(a,sa,i,b,sb,j)) j++;
54         if (j>m)
55         {
56             ans[++lans]=i-m+1;
57             j=fail[j];
58         }
59     }
60     printf("%d\n",lans);
61     for (int i=1;i<=lans;i++) printf("%d\n",ans[i]);
62     return 0;
63 }