#include <bits/stdc++.h>
using namespace std;

int main()
{
  int N; cin >> N;
  int M; cin >> M;
  constexpr int bound_M2 = 12;
  int ij[bound_M2][2];
  for( int m = 0 ; m < M ; m++ ){
    int im; cin >> im;
    int jm; cin >> jm;
    ij[m][0] = ij[m+M][1] = im;
    ij[m][1] = ij[m+M][0] = jm;
  }
  set<int> vertex_exception{};
  for( int i = 0 ; i < 3 ; i++ ){
    int v; cin >> v;
    vertex_exception.insert( v );
  }
  int M2 = M * 2;
  for( int m0 = 0 ; m0 < M2 ; m0++ ){
    for( int m1 = 0 ; m1 < M2 ; m1++ ){
      for( int m2 = 0 ; m2 < M2 ; m2++ ){
	if( vector<int>{ ij[m0][1] , ij[m1][1] , ij[m2][1] } == vector<int>{ ij[m1][0] , ij[m2][0] , ij[m0][0] } ){
	  set<int> edge{ m0 % M , m1 % M , m2 % M };
	  set<int> vertex{ ij[m0][0] , ij[m1][0] , ij[m2][0] };
	  if( vertex.size() == 3 && edge.size() == 3 && vertex != vertex_exception ){
	    cout << "Yes\n";
	    return 0;
	  }
	  continue;
	}
	for( int m3 = 0 ; m3 < M2 ; m3++ ){
	  if( vector<int>{ ij[m0][1] , ij[m1][1] , ij[m2][1] , ij[m3][1] } == vector<int>{ ij[m1][0] , ij[m2][0] , ij[m3][0] , ij[m0][0] } ){
	    set<int> edge{ m0 % M , m1 % M , m2 % M , m3 % M };
	    set<int> vertex{ ij[m0][0] , ij[m1][0] , ij[m2][0] , ij[m3][0] };
	    if( vertex.size() == 4 && edge.size() == 4 ){
	      cout << "Yes\n";
	      return 0;
	    }
	    continue;
	  }
	}
      }
    }
  }
  cout << "No\n";
  return 0;
}