// 入力制約確認用 #include using namespace std; int main() { int N; cin >> N; assert( 1 <= N && N <= 4 ); int M; cin >> M; assert( 0 <= M && M <= N * ( N - 1 ) / 2 ); int count[N]{}; bool found[N][N]{}; for( int m = 0 ; m < M ; m++ ){ int i; cin >> i; assert( 0 <= i ); int j; cin >> j; assert( i < j && j < N && !found[i][j] ); count[i]++; count[j]++; found[i][j] = true; } set vertex_exception{}; for( int i = 0 ; i < 3 ; i++ ){ int v; cin >> v; assert( 0 <= v && v < N ); vertex_exception.insert( v ); } set vertex{}; for( int i = 0 ; i < N ; i++ ){ if( count[i] >= 2 ){ vertex.insert( i ); } } cout << ( M >= 5 || vertex.size() >= 3 && vertex != vertex_exception ? "Yes\n" : "No\n" ); return 0; }