#include <bits/stdc++.h>

using namespace std;
#define int long long
#define app push_back
#define all(x) (x).begin(),(x).end()
#ifdef LOCAL
#define debug(...) [](auto...a){ ((cout << a << ' '), ...) << endl;}(#__VA_ARGS__, ":", __VA_ARGS__)
#define debugv(v) do {cout<< #v <<" : {"; for(int i=0;i<v.size();++i) {cout << v[i];if(i+1!=v.size()) cout << ","; }cout <<"}"<< endl;} while(0)
#else
#define debug(...)
#define debugv(v)
#endif
#ifdef LOCAL
#define __int128 long long
#endif // LOCAL
const int p=998244353;
int po(int a,int b) {if(b==0) return 1; if(b==1) return a; if(b%2==0) {int u=po(a,b/2);return (u*1LL*u)%p;} else {int u=po(a,b-1);return (a*1LL*u)%p;}}
int inv(int x) {return po(x,p-2);}
mt19937 rnd;
int n,m;
map<int,int> pos;
bool check(vector<int> &a,int id)
{
    int val=a[id];
    for(int i=id;i<id+m;++i)
    {
        if(a[i]!=(val+i-id)%n)
        {
            return false;
        }
    }
    return true;
}
int32_t main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin>>n>>m;
    for(int i=0;i<n;++i) {int x;cin>>x;pos[x]=i;}
    vector<int> a(m);for(int i=0;i<m;++i) {cin>>a[i];a[i]=pos[a[i]];}
    set<int> a1;for(int x:a) a1.insert(x);
    if(a1.size()!=a.size())
    {
        cout<<0;return 0;
    }
    bool ok=0;
    if(m<n)
    {
        ok=check(a,0);
        reverse(all(a));
        ok=(ok || check(a,0));
    }
    else
    {
        for(int i=0;i<n;++i) a.app(a[a.size()-n]);
        for(int i=0;i<n;++i) if(check(a,i)) ok=true;
        reverse(all(a));
        for(int i=0;i<n;++i) if(check(a,i)) ok=true;
    }
    cout<<ok;
    return 0;
}