#include <bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;

cs int N = 2e6; 

int n, m; 
int a[N], b[N];
int aa[N], bb[N]; 
int nxt[N];

int c0[N], c1[N], T; 
void add(int x, int c) {
    for(; x <= T; x += x & -x) c0[x] += c;
} 
int rk(int x) {
    int ans = 0; 
    for(; x; x -= x & -x) ans += c0[x];
    return ans; 
} 
void addb(int x, int c) {
    for(; x <= T; x += x & -x) c1[x] += c; 
} 
int rkb(int x) {
    int ans = 0; 
    for(; x; x -= x & -x) ans += c1[x];
    return ans; 
}

int main() {
    #ifdef zqj
    freopen("1.in","r",stdin);
    #endif
    ios :: sync_with_stdio(0), cin.tie(0);
    cin >> n >> m; 

    for(int i = 1; i <= n; i++) cin >> a[i], aa[i] = a[i];
    for(int i =1 ; i <= m; i++) cin >> b[i], bb[i] = b[i];
    sort(aa + 1, aa + n + 1); 
    sort(bb + 1, bb + m + 1);
    int cc = unique(aa + 1, aa + n + 1) - aa - 1; 
    int dd = unique(bb + 1, bb + m + 1) - bb - 1; 
    T = max(cc, dd);
    for(int i = 1; i  <= n; i++) a[i] = lower_bound(aa + 1, aa + cc + 1, a[i]) - aa; 
    for(int i = 1; i  <= m; i++) b[i] = lower_bound(bb + 1, bb + dd + 1, b[i]) - bb; 
    for(int i = 2, j = 0; i <= n; i++) {
        // rank a[i] in [i - j, i - 1]
        // rank a[j + 1] in [1, j]
        while(j && rkb(a[i]) != rk(a[j + 1])) {
            int k = nxt[j];
            while(j > k) {
                add(a[j], -1);
                addb(a[i - j], -1);
                -- j; 
            }
        }
        if(rkb(a[i]) == rk(a[j + 1])) ++ j, add(a[j], 1);
        nxt[i] = j;
        addb(a[i], 1);
        // cout << i << ' ' << nxt[i] << endl;
    }
    memset(c0, 0, sizeof c0);
    memset(c1, 0, sizeof c1);
    int flag = 0; 
    for(int i = 1, j = 0; i <= m; i++) {
        // rank b[i] in [i - j, i - 1]
        // rank a[j + 1] in [1, j]
        while(j && rkb(b[i]) != rk(a[j + 1])) {
            int k = nxt[j];
            while(j > k) {
                add(a[j], -1);
                // cerr << "decffs " << i - j << endl;
                addb(b[i - j], -1);
                -- j; 
            }
        }
        // cout << i << ' ' << j << ' ' << rk(a[j + 1]) << ' ' <<rkb(b[i]) << endl;
        if(rk(a[j + 1]) == rkb(b[i])) {
            ++ j;
            add(a[j], 1);
        }
        // cout << i << ' ' << j << endl;
        // cerr << "add " << i << endl;
        addb(b[i], 1);
        if(j == n) {
            flag =1; 
            cout << i - j + 1 << ' ';
            int k = nxt[j];
            while(j > k) {
                add(a[j], -1);
                addb(b[i - j + 1], -1);
                // cerr << "dec " << i - j << endl;
                -- j; 
            }
        }
    }
    if(flag == 0) {
        cout << 0 << '\n';
    }
    else {
        cout << '\n';
    }
    return 0; 
}