#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, Q;
  cin >> N >> Q;
  vector<int> A(Q);
  for (int i = 0; i < Q; i++){
    cin >> A[i];
    A[i]--;
  }
  vector<int> B(Q);
  for (int i = 0; i < Q; i++){
    cin >> B[i];
    B[i]--;
  }
  for (int i = 0; i < Q; i++){
    if (A[i] > B[i]){
      swap(A[i], B[i]);
    }
  }
  vector<vector<int>> E(Q * 2 + 2);
  for (int i = 0; i < Q; i++){
    if (A[i] == 0){
      E[Q * 2].push_back(i * 2);
    }
    if (B[i] == 0){
      E[Q * 2].push_back(i * 2 + 1);
    }
    if (A[i] == N - 1){
      E[i * 2].push_back(Q * 2 + 1);
    }
    if (B[i] == N - 1){
      E[i * 2 + 1].push_back(Q * 2 + 1);
    }
    if (abs(A[i] - B[i]) == 1){
      E[i * 2].push_back(i * 2 + 1);
      E[i * 2 + 1].push_back(i * 2);
    }
    if (i > 0){
      if (A[i] == A[i - 1]){
        E[i * 2 - 2].push_back(i * 2);
        E[i * 2].push_back(i * 2 - 2);
      }
      if (A[i] == B[i - 1]){
        E[i * 2 - 1].push_back(i * 2);
        E[i * 2].push_back(i * 2 - 1);
      }
      if (B[i] == A[i - 1]){
        E[i * 2 - 2].push_back(i * 2 + 1);
        E[i * 2 + 1].push_back(i * 2 - 2);
      }
      if (B[i] == B[i - 1]){
        E[i * 2 - 1].push_back(i * 2 + 1);
        E[i * 2 + 1].push_back(i * 2 - 1);
      }
    }
  }
  vector<bool> used(Q * 2 + 2, false);
  used[Q * 2] = true;
  queue<int> q;
  q.push(Q * 2);
  while (!q.empty()){
    int v = q.front();
    q.pop();
    for (int w : E[v]){
      if (!used[w]){
        used[w] = true;
        q.push(w);
      }
    }
  }
  if (used[Q * 2 + 1]){
    cout << "NO" << endl;
  } else {
    assert(false);
    vector<bool> ok1(Q, true), ok2(Q, true);
    for (int i = Q - 1; i >= 0; i--){
      if (A[i] == 0){
        ok1[i] = false;
      }
      if (B[i] == N - 1){
        ok2[i] = false;
      }
      if (i < Q - 1){
      }
    }
    cout << "YES" << endl;
  }
}