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

int main(){
    int n, m, u, v;
    cin >> n >> m;
    array<array<bool,4>,4> A{};
    for(int i = 0; i < m; i++){
        cin >> u >> v;
        A[u][v] = A[v][u] = 1;
    }
    vector<int> a(3), b = {0, 1, 2, 3};
    for(auto &&v : a) cin >> v;
    sort(a.begin(), a.end());
    auto check = [&](vector<int> c){
        sort(c.begin(), c.end());
        return c != a;
    };
    do{
        if(A[b[0]][b[1]] && A[b[1]][b[2]] && ((A[b[2]][b[0]] && check({b[0], b[1], b[2]})) || (A[b[2]][b[3]] && A[b[3]][b[0]]))){
            cout << "Yes\n";
            exit(0);
        }
    }while(next_permutation(b.begin(), b.end()));
    cout << "No\n";
}