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;
namespace io {
inline int rdi() {
  int v;
  cin >> v;
  return v;
}
inline long long rdll() {
  long long v;
  cin >> v;
  return v;
}
inline string rds() {
  string s;
  cin >> s;
  return s;
}
inline char rdc() {
  char c;
  cin >> c;
  return c;
}
template <class T>
void rdv(T beg_iter, T end_iter) {
  for (; beg_iter != end_iter; ++beg_iter) cin >> *beg_iter;
}
inline void wri(const int v) { cout << v; }
inline void wrll(const long long& v) { cout << v; }
inline void wrs(const string& s) { cout << s; }
inline void wrc(const char c) { cout << c; }
template <class T>
void wrv(T beg_iter, T end_iter, string separator = " ",
         string end_of_line = "\n") {
  for (; beg_iter != end_iter; ++beg_iter) {
    cout << *beg_iter;
    cout << separator;
  }
  cout << end_of_line;
}
}  // namespace io
using namespace io;
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    x = (x * x) % p;
  }
  return res;
}
void solve();
int main() {
  int t = 1;
  while (t--) solve();
  return 0;
}
void solve() {
  int n = rdi(), m = rdi();
  vector<pair<int, int>> A;
  for (int i = 0; i < m; ++i) {
    int a = rdi(), b = rdi();
    A.push_back(make_pair(a, b));
  }
  int x1 = A[0].first, x2 = A[0].second;
  int y1 = x1, y2 = x2;
  for (int i = 1; i < m; ++i) {
    if (A[i].first != x1 && A[i].second != x1) {
      y1 = A[i].first;
      y2 = A[i].second;
      break;
    }
  }
  bool flag = 1;
  for (int i = 1; i < m; ++i) {
    if (A[i].first != x1 && A[i].second != x1 && A[i].first != y1 &&
        A[i].second != y1) {
      flag = 0;
      break;
    }
  }
  if (flag == 1) {
    cout << "YES" << '\n';
    return;
  }
  flag = 1;
  for (int i = 1; i < m; ++i) {
    if (A[i].first != x1 && A[i].second != x1 && A[i].first != y2 &&
        A[i].second != y2) {
      flag = 0;
      break;
    }
  }
  if (flag == 1) {
    cout << "YES" << '\n';
    return;
  }
  for (int i = 1; i < m; ++i) {
    if (A[i].first != x2 && A[i].second != x2) {
      y1 = A[i].first;
      y2 = A[i].second;
      break;
    }
  }
  flag = 1;
  for (int i = 1; i < m; ++i) {
    if (A[i].first != x2 && A[i].second != x2 && A[i].first != y1 &&
        A[i].second != y1) {
      flag = 0;
      break;
    }
  }
  if (flag == 1) {
    cout << "YES" << '\n';
    return;
  }
  flag = 1;
  for (int i = 1; i < m; ++i) {
    if (A[i].first != x2 && A[i].second != x2 && A[i].first != y2 &&
        A[i].second != y2) {
      flag = 0;
      break;
    }
  }
  if (flag == 1) {
    cout << "YES" << '\n';
    return;
  }
  cout << "NO" << '\n';
}
