#include <bits/stdc++.h>
using namespace std;
#define mid ((l+r)/2)
const int N=1e6+5,MOD=1e9+7,base=998244353;
int n,m,hs,s,a[N],b[N],dsa[N],dsb[N],pw[N];bool fl;
struct Seg {int vl,vl1;}sg[N*4];
void work(int ds[]) {sort(ds+1,ds+ds[0]+1);ds[0]=unique(ds+1,ds+ds[0]+1)-ds-1;}
int id(int ds[],int x) {return lower_bound(ds+1,ds+ds[0]+1,x)-ds;}
void pu(int p)
{
    sg[p].vl=(1ll*sg[p*2].vl*pw[sg[p*2+1].vl1]+sg[p*2+1].vl)%MOD;
    sg[p].vl1=sg[p*2].vl1+sg[p*2+1].vl1;
}
void upd(int p,int l,int r,int x,int vl)
{
    if(l==r) {sg[p].vl=(1ll*sg[p].vl*base+vl)%MOD;++sg[p].vl1;return;}
    if(x<=mid) upd(p*2,l,mid,x,vl);else upd(p*2+1,mid+1,r,x,vl);pu(p);
}
void upd1(int p,int l,int r,int x,int vl)
{
    if(l==r) {--sg[p].vl1;sg[p].vl=(sg[p].vl+1ll*(MOD-vl)*pw[sg[p].vl1])%MOD;return;}
    if(x<=mid) upd1(p*2,l,mid,x,vl);else upd1(p*2+1,mid+1,r,x,vl);pu(p);
}
int main()
{
    scanf("%d %d",&n,&m);
    for(int i=1;i<=n;++i) scanf("%d",&a[i]),dsa[++dsa[0]]=a[i];
    for(int i=1;i<=m;++i) scanf("%d",&b[i]),dsb[++dsb[0]]=b[i];
    work(dsa);work(dsb);
    for(int i=1;i<=n;++i) a[i]=id(dsa,a[i]);
    for(int i=1;i<=m;++i) b[i]=id(dsb,b[i]);
    pw[0]=1;for(int i=1;i<=n;++i) pw[i]=1ll*pw[i-1]*base%MOD;
    for(int i=1,t;i<=n;++i)
    {
        t=0;
        for(int j=1;j<=n;++j) if(a[i]<a[j] || (a[i]==a[j] && i<j)) ++t;
        hs=(hs+1ll*pw[t]*i)%MOD;
    }
    for(int i=0;i<n;++i) s=(s+pw[i])%MOD;
    for(int i=1;i<=m;++i)
    {
        upd(1,1,dsb[0],b[i],i);
        if(i>n) upd1(1,1,dsb[0],b[i-n],i-n);
        if(i>=n && sg[1].vl==(hs+1ll*s*(i-n))%MOD) printf("%d ",i-n+1),fl=1;
    }
    if(!fl) puts("0");
    return 0;
}