Toad Ivan has m pairs of integers, each integer is between 1 and n, inclusive. The pairs are (a_1, b_1), (a_2, b_2), …, (a_m, b_m). 

He asks you to check if there exist two integers x and y (1 ≤ x < y ≤ n) such that in each given pair at least one integer is equal to x or y.

Input

The first line contains two space-separated integers n and m (2 ≤ n ≤ 300 000, 1 ≤ m ≤ 300 000) — the upper bound on the values of integers in the pairs, and the number of given pairs.

The next m lines contain two integers each, the i-th of them contains two space-separated integers a_i and b_i (1 ≤ a_i, b_i ≤ n, a_i ≠ b_i) — the integers in the i-th pair.

Output

Output "YES" if there exist two integers x and y (1 ≤ x < y ≤ n) such that in each given pair at least one integer is equal to x or y. Otherwise, print "NO". You can print each letter in any case (upper or lower).

Examples

Input


4 6
1 2
1 3
1 4
2 3
2 4
3 4


Output


NO


Input


5 4
1 2
2 3
3 4
4 5


Output


YES


Input


300000 5
1 2
1 2
1 2
1 2
1 2


Output


YES

Note

In the first example, you can't choose any x, y because for each such pair you can find a given pair where both numbers are different from chosen integers.

In the second example, you can choose x=2 and y=4.

In the third example, you can choose x=1 and y=2.
#include <bits/stdc++.h>
using namespace std;
template <class T>
int getbit(T s, int i) {
  return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
  return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
  return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
  return __builtin_popcount(s);
}
template <class T>
inline T gcd(T a, T b) {
  T r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long n, m, x, y, dd[300005];
pair<long long, long long> z[300005];
set<long long> s;
long long Rand(long long l, long long h) {
  return l +
         ((long long)rand() * (RAND_MAX + 1) * (RAND_MAX + 1) * (RAND_MAX + 1) +
          (long long)rand() * (RAND_MAX + 1) * (RAND_MAX + 1) +
          (long long)rand() * (RAND_MAX + 1) + rand()) %
             (h - l + 1);
}
void check(long long a, long long b) {
  for (long long i = 1, _b = m; i <= _b; i++) {
    if (z[i].first == a || z[i].first == b || z[i].second == a ||
        z[i].second == b)
      continue;
    return;
  }
  cout << "YES";
  exit(0);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m;
  for (long long i = 1, _b = m; i <= _b; i++) cin >> z[i].first >> z[i].second;
  for (long long i = 1, _b = m; i <= _b; i++) {
    if (z[i].first > z[i].second) swap(z[i].first, z[i].second);
    s.insert(z[i].first);
    s.insert(z[i].second);
  }
  if (s.size() <= 2) {
    cout << "YES";
    return 0;
  }
  if (s.size() == 3) {
    vector<long long> v;
    for (auto x : s) v.push_back(x);
    check(v[0], v[1]);
    check(v[0], v[2]);
    check(v[1], v[2]);
    cout << "NO";
    return 0;
  }
  if (s.size() == 4) {
    vector<long long> v;
    for (auto x : s) v.push_back(x);
    check(v[0], v[1]);
    check(v[0], v[2]);
    check(v[0], v[3]);
    check(v[1], v[2]);
    check(v[1], v[3]);
    check(v[2], v[3]);
    cout << "NO";
    return 0;
  }
  check(z[1].first, z[1].second);
  for (long long i = 2, _b = m; i <= _b; i++) {
    if (z[i].first != z[1].first && z[i].first != z[1].second &&
        z[i].second != z[1].first && z[i].second != z[1].second) {
      vector<long long> v;
      v.push_back(z[i].first);
      v.push_back(z[1].first);
      v.push_back(z[i].second);
      v.push_back(z[1].second);
      check(v[0], v[1]);
      check(v[0], v[2]);
      check(v[0], v[3]);
      check(v[1], v[2]);
      check(v[1], v[3]);
      check(v[2], v[3]);
      cout << "NO";
      return 0;
    }
  }
  cout << "NO";
  return 0;
}
