#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
using namespace std;

#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define fi first
#define se second

#define INF 2147483600

#define N 20000
#define M 50000
typedef pair<int, int> P;
vector<int> g[N];
vector<int> len2[N];
P edg[M];

int main(){
  int n,m;
  cin>>n>>m;
  rep(i,m){
    int a,b;
    scanf("%d %d", &a, &b);
    a--;b--;
    g[a].pb(b);
    g[b].pb(a);
    edg[i]=mp(a,b);
  }

  rep(i, g[0].size()){
    int mid = g[0][i];
    rep(j, g[mid].size()){
      int tgt = g[mid][j];
      // 0->mid->tgt
      if(tgt==0) continue;
      len2[tgt].pb(mid);
    }
  }

  rep(i, m){
    int a[2] = {edg[i].fi, edg[i].se};
    bool flg=true;
    int keep[2]={-1, -1};
    rep(j,2){
      int sz = len2[a[j]].size();
      if(sz>=3) continue;
      else if(sz==2){
        rep(k,2)if(len2[a[j]][k] == a[!j]){
          keep[j] = len2[a[j]][!k];
        }
      }
      else if(sz==1){
        if(len2[a[j]][0]==a[!j]) flg=false;
        else keep[j] = len2[a[j]][0];
      }
      else if(sz==0) flg=false;
    }
    if(!flg) continue;
    if(keep[0]!=-1 && keep[1]!=-1 && keep[0]==keep[1]) continue;
    cout<<"YES"<<endl;
    return 0;
  }

  cout<<"NO"<<endl;

  return 0;
}