#include<bits/stdc++.h>
using namespace std;
#define vec vector
template<typename T>
void operator +=(vec<T> &v,const T &x){
    v.push_back(x);
}
#define mp make_pair
#define pii pair<int,int>
#define x first
#define y second
#define exc(expr) if(expr)continue;
#define stop(expr) if(expr)break;
#define ret(expr) if(expr)return;
#define inf (long long)(1e18)
#define int long long
const int mod=998244353;
int fpm(int x,int y){
    int ans=1;for(;y;y>>=1,(x*=x)%=mod)if(y&1)(ans*=x)%=mod;return ans;
}
template<typename T>
bool Min(T &x,const T &y){
    return x>y?x=y,1:0;
}
template<typename T>
bool Max(T &x,const T &y){
    return x<y?x=y,1:0;
}

int n,m,a[1000010],b[1000010];
void shift(int* a,int n){
    for(int i=0;i<n;i++){
        a[i+n]=a[i];
    }
    a[n+n]=-1;
    int x=1,y=2;
    while(x<=n&&y<=n){
        if(x>y)swap(x,y);

        int l=0;
        while(a[x+l]==a[y+l]){
            ++l;
        }

        if(a[x+l]>a[y+l]){
            x+=l+1;
        }else{
            y+=l+1;
        }
        
        if(x==y)++y;
    }

    if(x>y)swap(x,y);

    for(int i=0;i<n;i++){
        a[i]=a[(x+i)%n+n];
    }
}
void work(){
    cin>>n>>m;
    for(int i=0;i<n;i++)cin>>a[i];
    for(int i=0;i<m;i++)cin>>b[i];

    int g=__gcd(n,m);

    for(int i=0;i<n;i++){
        if(a[i]!=a[(i+g)%n]){
            cout<<"NO\n";return;
        }
    }
    for(int i=0;i<m;i++){
        if(b[i]!=b[(i+g)%m]){
            cout<<"NO\n";return;
        }
    }
    shift(a,g);
    shift(b,g);

    for(int i=0;i<g;i++){
        if(a[i]!=b[i]){
            cout<<"NO\n";return;
        }
    }
    cout<<"YES\n";
}
signed main(){
    ios::sync_with_stdio(0),
    cin.tie(0),cout.tie(0);
    int T=1;while(T--)work();
}