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;
int main() {
  long long n, m, i, u, v, flag = 0;
  cin >> n >> m;
  long long a[m], b[m];
  map<pair<long long, long long>, long long> m2;
  map<long long, long long> m1;
  map<long long, long long> m3;
  for (i = 0; i < m; i++) {
    cin >> a[i] >> b[i];
    m2[make_pair(a[i], b[i])]++;
    m2[make_pair(b[i], a[i])]++;
    m1[a[i]]++;
    m1[b[i]]++;
  }
  map<long long, long long>::iterator it = m1.begin();
  for (i = 0; i < m; i++) {
    long long t = m1[a[i]] + m1[b[i]] - m2[{a[i], b[i]}];
    if (t == m) {
      flag = 1;
      break;
    }
  }
  if (flag == 1) {
    cout << "YES";
  } else {
    long long f = a[0], e = b[0], f1, e1;
    for (i = 0; i < m; i++) {
      if (a[i] != f && b[i] != f) {
        f1 = a[i];
        e1 = b[i];
      }
    }
    if (m1[f] + m1[f1] - m2[{f, f1}] == m) {
      flag = 1;
    } else if (m1[f] + m1[e1] - m2[{f, e1}] == m) {
      flag = 1;
    }
    for (i = 0; i < m; i++) {
      if (a[i] != e && b[i] != e) {
        f1 = a[i];
        e1 = b[i];
      }
    }
    if (m1[e] + m1[f1] - m2[{f, f1}] == m) {
      flag = 1;
    } else if (m1[e] + m1[e1] - m2[{f, e1}] == m) {
      flag = 1;
    }
    if (flag == 1) {
      cout << "YES";
    } else {
      cout << "NO";
    }
  }
  return 0;
}
