/*************************************
* author: marvinthang *
* created: 15.02.2023 15:22:23 *
*************************************/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> scan_op(pair <U, V>) { return in >> u.fi >> u.se; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
// end of template
const int MAX = 1e6 + 5;
int N, M, S[MAX], H[MAX + MAX];
void init(void) {
cin >> N >> M;
REP(i, N) cin >> S[i];
REP(i, M) cin >> H[i + N];
}
int pre[MAX], nxt[MAX], left[MAX], right[MAX], kmp[MAX + MAX];
bool check(int j, int i) {
if (j == N) return false;
if (~left[j] && H[i] <= H[i - j + left[j]]) return false;
if (~right[j] && H[i] >= H[i - j + right[j]]) return false;
return true;
}
void process(void) {
REP(i, N) {
H[--S[i]] = i;
pre[i] = i - 1;
nxt[i] = i + 1;
}
FORD(i, N - 1, 0) {
int p = pre[H[i]], n = nxt[H[i]];
left[i] = p >= 0 ? S[p] : -1;
right[i] = n < N ? S[n] : -1;
if (p >= 0) nxt[p] = n;
if (n < N) pre[n] = p;
}
vector <int> res;
FOR(i, 1, M + N - 1) {
int j = kmp[i - 1];
while (j && !check(j, i)) j = kmp[j - 1];
if (check(j, i)) ++j;
kmp[i] = j;
if (j == N) res.push_back(i - N - N + 2);
}
cout << res.size() << '\n';
for (int x: res) cout << x << ' ';
}
int main(void) {
ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
file("test");
init();
process();
cerr << "Time elapsed: " << TIME << " s.\n";
return (0^0);
}
