#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))

using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; }

template <typename C, typename D>
struct Graph {
  struct Edge {
    int to, rev;
    C cap;
    D cost;
    Edge(int to, C cap, D cost, int rev) : to(to), cap(cap), cost(cost), rev(rev) {}
  };
  vector<vector<Edge>> edges;
  int n;
  Graph(int n) : n(n) {
    edges = vector<vector<Edge>>(n);
  }
  void add_edge(int v, int u, C ca = 1, D co = 0) {
    edges[v].emplace_back(u, ca, co, (int) edges[u].size());
    edges[u].emplace_back(v, 0, -co, (int) edges[v].size() - 1);
  }
};

template <typename C, typename D>
C max_flow(Graph<C, D> &g, int s, int t) {
  const int n = g.n;
  auto &G = g.edges;

  C flow = 0;
  vector<int> used(n);
  int ui = 0;
  function<C(int, int, C)> dfs = [&](int v, int t, C f) {
    if (v == t) return f;
    used[v] = ui;
    for (int i = 0; i < G[v].size(); i++) {
      auto &e = G[v][i];
      if (used[e.to] == ui || e.cap == 0) continue;
      int d = dfs(e.to, t, min(f, e.cap));
      if (d == 0) continue;
      e.cap -= d;
      G[e.to][e.rev].cap += d;
      return d;
    }
    return 0;
  };
  while (true) {
    ui++;
    int f = dfs(s, t, numeric_limits<C>::max());
    if (f == 0) return flow;
    flow += f;
  }
}

void solve() {
  int n, m; cin >> n >> m;
  vector<vector<int>> es(n);
  vector<int> deg(n);
  rep(i, m) {
    int a, b; cin >> a >> b;
    a--, b--;
    es[a].push_back(b);
    es[b].push_back(a);
    deg[a]++, deg[b]++;
  }
  int to = 0, fo = 0, si = 0;
  int fe = -1, te = -1;
  rep(i, n) {
    if (deg[i] % 2 != 0) no();
    deg[i] == 2 ? to++ : deg[i] == 4 ? fo++ : si++;
    if (deg[i] == 4) {
      if (fe == -1) fe = i;
      else te = i;
    }
  }
  if (si) yes();
  if (!fo || fo == 1) no();
  if (fo >= 3) yes();

  auto graph = Graph<int, int>(n);
  rep(i, n) each(j, es[i]) {
    graph.add_edge(i, j);
  }
  int fa = max_flow(graph, fe, te);
  if (fa == 2) yes(); no();
}


Measured memory_bytes: 19200