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;
const long long MOD = 1e9 + 7;
int32_t main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long t;
  t = 1;
  for (long long tc = 0; tc < t; tc++) {
    long long n, m;
    cin >> n >> m;
    vector<pair<long long, long long> > arr(m);
    for (long long i1 = 0; i1 < m; i1++) cin >> arr[i1].first >> arr[i1].second;
    long long a = arr[0].first;
    set<long long> st;
    st.insert(0);
    for (long long i = 1; i < m; i++) {
      if (arr[i].first == a || arr[i].second == a) {
        st.insert(i);
      }
    }
    long long cnt1 = st.size();
    vector<long long> v(n + 5, 0);
    for (long long i = 0; i < m; i++) {
      if (!st.count(i)) {
        v[arr[i].first]++;
        v[arr[i].second]++;
      }
    }
    bool g1 = 0;
    for (long long x = 1; x <= n; x++) {
      if (x != a) {
        if (v[x] + cnt1 == m) {
          g1 = 1;
          break;
        }
      }
    }
    if (g1)
      cout << "YES"
           << "\n";
    else {
      long long a = arr[0].second;
      set<long long> st;
      st.insert(0);
      for (long long i = 1; i < m; i++) {
        if (arr[i].first == a || arr[i].second == a) {
          st.insert(i);
        }
      }
      long long cnt1 = st.size();
      vector<long long> v(n + 5, 0);
      for (long long i = 0; i < m; i++) {
        if (!st.count(i)) {
          v[arr[i].first]++;
          v[arr[i].second]++;
        }
      }
      bool g2 = 0;
      for (long long x = 1; x <= n; x++) {
        if (x != a) {
          if (v[x] + cnt1 == m) {
            g2 = 1;
            break;
          }
        }
      }
      if (g2)
        cout << "YES"
             << "\n";
      else
        cout << "NO"
             << "\n";
    }
  }
  return 0;
}
