#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;

template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

const int SZ=100000;

signed main(){
    int N,M;cin>>N>>M;
    vector<int> A(M),B(M);
    cin>>A>>B;

    bitset<SZ> P;
    P=~P;
    rep(i,N){
        P=(P>>1)|P|(P<<1);
        bitset<SZ> cur;
        cur=~cur;
        cur[A[i]-1]=0;
        cur[B[i]-1]=0;

        auto need=(cur>>1)|cur|(cur<<1);

        P&=need;
        P&=cur;
    }
    int last=-1;
    rep(i,N){
        if(P[i]) last=i;
    }
    if(last<0){
        cout<<"NO"<<endl;
        return 0;
    }
    return 0;
}