#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int N, M;
vector<int> G[20000];
bool used[20000];

int can(int u, int p, int n){
    bool f = false;
    for(int v : G[u]){
        if(v != p && used[v] && n == 5){return true;}

        if(!used[v]){
            used[v] = true;
            // std::cout << "-> " << v << std::endl;
            f = f || can(v, u, n + 1);
        }
    }

    return f;
}

int main(){
    //*
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    /*/
      /*/

    std::cin >> N >> M;

    for(int i=0;i<M;++i){
        int A, B;
        std::cin >> A >> B;

        --A; --B;

        G[A].emplace_back(B);
        G[B].emplace_back(A);
    }
    
    bool f = false;
    for(int i=0;i<N;++i){
        if(!used[i]){
            // std::cout << i << std::endl;
            used[i] = true;
            f = f || can(i, -1, 1);
            // std::cout << i << ", " << f << std::endl;
        }
    }

    if(f){
        std::cout << "YES" << std::endl;
    }else{
        std::cout << "NO" << std::endl;
    }
}