#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
#include<map>
#include<bitset>

using namespace std;
typedef long long ll;
#define i_7 (ll)(1E9+7)
#define i_5 (ll)(1E9+5)
ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    else return c+i_7;
}
typedef pair<int,int> i_i;
typedef pair<ll,ll> l_l;
ll inf=(ll)1E12;/*10^12*/
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}

////////////////////////////////////////




int n,m;
vector<int>v[100005];
bool ans=false;
bool al[100005];

void dfs(int t,int d){
    if(d==5||ans)return;
    else if(d==4){
        for(auto x:v[t])if(x==0){
            ans=true;
        }
    }else{
        for(auto x:v[t]){
            if(!al[x]){
                al[x]=true;
                dfs(x,d+1);
                al[x]=false;
            }
        }
    }
}


int main(){
    cin>>n>>m;
    rep(i,0,m-1){
        int s,t;cin>>s>>t;s--;t--;
        v[s].pb(t);
        v[t].pb(s);
    }
    dfs(0,0);
    rep(i,1,n-1)al[i]=false;al[0]=true;
    if(ans)cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
    
    return 0;
}