#include <bits/stdc++.h>

using namespace std;

#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x)                                                              \
    for(auto &youso_ : (x)) cin >> youso_
#define mp make_pair
#define bitcnt __builtin_popcount
#define SZ(x) ((ll)(x).size())
#define All(a) (a).begin(), (a).end()
template <typename T = long long> inline T IN() {
    T x;
    cin >> x;
    return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
    cin >> head;
    CIN(move(tail)...);
}
#define CINT(...)                                                              \
    int __VA_ARGS__;                                                           \
    CIN(__VA_ARGS__)
#define LCIN(...)                                                              \
    ll __VA_ARGS__;                                                            \
    CIN(__VA_ARGS__)
#define SCIN(...)                                                              \
    string __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v)                                                              \
    {                                                                          \
        FOREACH(x, v) { cout << x << " "; }                                    \
        cout << "\n";                                                          \
    }
template <typename T = string> inline void eputs(T s) {
    cout << s << "\n";
    exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
    std::fill((T *)array, (T *)(array + N), val);
}

typedef long long ll;
typedef unsigned long long ul;
typedef vector<ll> VL;
typedef pair<ll, ll> PL;
typedef priority_queue<ll> PQ;
typedef priority_queue<ll, VL, greater<ll>> PQG;

const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18 + 1;
const ll dx[] = {1, -1, 0, 0};
const ll dy[] = {0, 0, 1, -1};

ll N, M;
vector<VL> G;
vector<bool> used;

bool dfs(ll now, ll p, ll s, ll t) {
    if(now == s && p != -1) return true;
    if(now != s) used[now] = true;
    for(auto next : G[now]) {
        if(next == p || next == t || used[next]) continue;
        if(dfs(next, now, s, t)) return true;
    }
    return false;
}

signed main() {
    cin >> N >> M;
    G.resize(N);
    REP(i, M) {
        LCIN(a, b);
        G[--a].emplace_back(--b);
        G[b].emplace_back(a);
    }
    map<ll, ll> order;

    REP(i, N) order[G[i].size()]++;
    FOREACH(o, order) if(o.first % 2 != 0) eputs("No");
    if(order[6] > 0 || order[4] >= 3)
        eputs("Yes");
    else if(order[4] <= 1)
        eputs("No");

    VL tgt;
    REP(i, N) if(G[i].size() == 4) tgt.emplace_back(i);
    ll f = tgt[0];
    ll t = tgt[1];
    used.assign(N, 0);
    if(dfs(f, -1, f, t))
        eputs("Yes");
    else
        eputs("No");
}

Measured memory_bytes: 7680