#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using LL = long long;
using pii = pair<int, int>;
#define sz(x) (signed)size(x)

vector<int> kmp(vector<int>& s) {
    int n = sz(s);
    vector<int> pi(n);
    for (int i = 1, j = 0; i < n; ++i) {
        while (j && s[i] != s[j]) j = pi[j - 1];
        if (s[i] == s[j]) ++j;
        pi[i] = j;
    }
    return pi;
}

void solve () {
    int n, m;
    cin >> n >> m;

    vector<int> a(n), b(m);
    for (int& i : a)
        cin >> i;
    for (int& i : b)
        cin >> i;

    vector<int> c = a;
    for (int i = 0; i < n; ++i)
        c.push_back(a[i]);
    c.push_back(-1);
    for (int i = 0; i < m; ++i)
        c.push_back(b[i]);

    bool f = 0;
    vector<int> pi = kmp(c);

    f |= *max_element(pi.begin(), pi.end()) == m;
    reverse(a.begin(), a.end());
    c.clear();
    for (int t = 0; t <= 1; ++t)
        for (int i = 0; i < n; ++i)
            c.push_back(a[i]);
    c.push_back(-1);
    for (int i = 0; i < m; ++i)
        c.push_back(b[i]);

    f |= *max_element(pi.begin(), pi.end()) == m;

    cout << f << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);

    solve();
}