#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>
#include <climits>
#include <numeric>
#include <functional>
#include <time.h>
#include <bitset>
#include <emmintrin.h>

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)a; i <= (int)b; i++)
template<class T> void checkmin(T &a, T b) { if (b < a) a = b; }
template<class T> void checkmax(T &a, T b) { if (b > a) a = b; }

const int MaxN = 20000;
const int MaxM = 50000;
int N, M;
bool Adj[MaxN][MaxN];
vector<Pii> E;

void solve() {
    rep(ea, E.size()) {
        int a = E[ea].first, b = E[ea].second;
        if (!Adj[0][a] && !Adj[0][b]) continue;
        ll eb = lower_bound(E.begin() + ea + 1, E.end(), Pii(a + 1, 0)) - E.begin();
        for (; eb < E.size(); eb++) {
            int c = E[eb].first, d = E[eb].second;
            if (Adj[0][a] && (Adj[b][c] && Adj[d][0] || Adj[b][d] && Adj[c][0]) ||
                Adj[0][b] && (Adj[a][c] && Adj[d][0] || Adj[a][d] && Adj[c][0])) {
                cout << "YES\n";
                return;
            }
        }
    }
    cout << "NO\n";
}

int main() {
    int N, M;
    scanf("%d %d", &N, &M);
    rep(i, M) {
        int a, b;
        scanf("%d %d", &a, &b);
        a--; b--;
        Adj[a][b] = Adj[b][a] = true;
        if (a > b) swap(a, b);
        if (a != 0) E.push_back(Pii(a, b));
    }
    sort(E.begin(), E.end());
    solve();
    return 0;
}