#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int N = 1000005;

int cnt[N],bit[N];

void modify(int p, int x){
    cnt[p]+=x;
    for(++p; p<N; p+=p&-p) bit[p]+=x;
}

pii query(int p){
    pii res;
    res.first=0;
    res.second=cnt[p]>0;
    for(++p; p; p-=p&-p) res.first+=bit[p];
    return res;
}

int n,m,a[N],b[N],fail[N];
pii val[N];

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    cin >> n >> m;
    for(int i=0; i<n; ++i) cin >> a[i];
    for(int i=0; i<m; ++i) cin >> b[i];
    if(n==1){
        for(int i=0; i<m; ++i) cout << i+1 << ' ';
        cout << "\n";
        return 0;
    }
    {
        vector<int> tmp(a,a+n);
        sort(all(tmp)),tmp.resize(unique(all(tmp))-tmp.begin());
        for(int i=0; i<n; ++i) a[i]=lower_bound(all(tmp),a[i])-tmp.begin();
    }
    {
        vector<int> tmp(b,b+m);
        sort(all(tmp)),tmp.resize(unique(all(tmp))-tmp.begin());
        for(int i=0; i<m; ++i) b[i]=lower_bound(all(tmp),b[i])-tmp.begin();
    }
    for(int i=0; i<n; ++i) val[i]=query(a[i]),modify(a[i],1);
    for(int i=0; i<n; ++i) modify(a[i],-1);
    fail[0]=-1,fail[1]=0;
    modify(a[1],1);
    int l=1,cur=0;
    for(int i=2; i<n; ++i){
        while(val[cur+1]!=query(a[i])){
            cur=fail[cur];
            while(l<i-1-cur) modify(a[l],-1),l++;
        }
        assert(val[cur+1]==query(a[i]));
        cur++;
        modify(a[i],1);
        fail[i]=cur;
    }
    //for(int i=0; i<n; ++i) cout << i << ' ' << fail[i] << endl;
    memset(cnt,0,sizeof cnt),memset(bit,0,sizeof bit);
    l=0,cur=0;
    modify(b[0],1);
    bool flag=0;
    for(int i=1; i<m; ++i){
        while(val[cur+1]!=query(b[i])){
            //cout << i << ' ' << cur << endl;
            cur=fail[cur];
            while(l<i-1-cur) modify(b[l],-1),l++;
        }
        assert(val[cur+1]==query(b[i]));
        cur++;
        modify(b[i],1);
        if(cur+1==n){
            cout << i-n+2 << ' ';
            flag=1;
            cur=fail[cur];
            while(l<i-cur) modify(b[l],-1),l++;
        }
        //cout << i << ' ' << l << ' ' << cur << endl;
    }
    if(!flag) cout << 0;
    cout << "\n";
}