#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>

using namespace std;

vector<vector<int>> connect_v;
vector<set<int>> connect_s;

template <class T>
void show(T t) {
	for (auto e : t) {
		cout << e << " ";
	}
	cout << endl;
}

bool dfs(vector<int> &v, int n_points) {
	int now, idx;

	switch (n_points) {
		case 1: now = v[2]; idx = 1; break;
		case 2: now = v[2]; idx = 3; break;
		case 3: now = v[1]; idx = 0; break;
		case 4: now = v[3]; idx = 4; break;
		case 5: return connect_s[v[4]].count(0) > 0;
		default:return false;
	}

	for (auto next : connect_v[now]) {
		if (find(v.begin(), v.end(), next) != v.end()) {
			continue;
		}
		v[idx] = next;
		if (dfs(v, n_points + 1)) {
			return true;
		}
		v[idx] = -1;
	}

	return false;
}

int main() {
	int n, m, a, b;

	scanf("%d %d", &n, &m);
	connect_v.assign(n, vector<int>());
	connect_s.assign(n, set<int>());
	for (int i = 0; i < m; i++) {
		scanf("%d %d", &a, &b);
		a--;
		b--;
		connect_v[a].emplace_back(b);
		connect_v[b].emplace_back(a);
		connect_s[a].insert(b);
		connect_s[b].insert(a);
	}

	vector<int> points(5, -1);
	points[2] = 0;
	bool ret = dfs(points, 1);

	if (ret) {
		printf("YES\n");
	} else {
		printf("NO\n");
	}
	return 0;
}