#include <bits/stdc++.h>

using namespace std;

#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vi >
#define vb vector<bool>
#define vvb vector<vb >
#define vp vector< pii >
#define all(a) (a).begin(), (a).end()
#define Int(x) int x; cin >> x;
#define int2(x, y) Int(x); Int(y);
#define int3(x, y, z) Int(x); int2(y, z);
#define in(x, a, b) ((a) <= (x) && (x) < (b))
#define fir first
#define sec second
#define ffir first.first
#define fsec first.second
#define sfir second.first
#define ssec second.second
#define Decimal fixed << setprecision(10)

//int dxy[5] = {0, 1, 0, -1, 0};
// cmd

using Weight = int;
using Flow = int;
struct Edge {
    int s, d; Weight w; Flow c;
    Edge() {};
    Edge(int s, int d, Weight w = 1) : s(s), d(d), w(w), c(w) {};
};
bool operator<(const Edge &e1, const Edge &e2) { return e1.w < e2.w; }
bool operator>(const Edge &e1, const Edge &e2) { return e2 < e1; }
inline ostream &operator<<(ostream &os, const Edge &e) { return (os << '(' << e.s << ", " << e.d << ", " << e.w << ')'); }

using Edges = vector<Edge>;
using Graph = vector<Edges>;
using Array = vector<Weight>;
using Matrix = vector<Array>;

void addArc(Graph &g, int s, int d, Weight w = 1) {
    g[s].emplace_back(s, d, w);
}
void addEdge(Graph &g, int a, int b, Weight w = 1) {
    addArc(g, a, b, w);
    addArc(g, b, a, w);
}

bool dfs(Graph &g, int a, int b, int bef)
{
    if (a == b) return true;
    //std::cout << "dfs: " << a << std::endl;
    rep(i, g[a].size()) {
        if (g[a][i].w && g[a][i].d != bef) {
            g[a][i].w = 0;
            return dfs(g, g[a][i].d, b, a);
        }
    }
    return false;
}

string solve(Graph &g, int a, int b)
{
    //std::cout << "call" << std::endl;
    bool ret = true;
    ret &= dfs(g, a, b, -1);
    //cout << ret << endl;
    ret &= dfs(g, a, b, -1);
    //cout << ret << endl;
    ret &= dfs(g, a, b, -1);
    //cout << ret << endl;
    ret &= dfs(g, a, b, -1);
    //cout << ret << endl;
    if (ret) {
        return "No";
    } else {
        return "Yes";
    }
}

signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    int2(n, m);
    Graph g(n);
    for (int i = 0; i < m; i++) {
        int2(tmpx, tmpy);
        ;
        tmpx--; tmpy--;
        addEdge(g, tmpx, tmpy );
    }

    rep(i, n) {
        if (g[i].size() % 2) {
            std::cout << "No" << std::endl;
            return 0;
        }
    }

    rep(i, n) {
        if (g[i].size() >= 6) {
            std::cout << "Yes" << std::endl;
            return 0;
        }
    }

    int cnt = 0;
    rep(i, n) {
        if (g[i].size() == 4) cnt++;
    }

    if (cnt > 2) {
        std::cout << "Yes" << std::endl;
        return 0;
    } else if (cnt < 2) {
        std::cout << "No" << std::endl;
        return 0;
    } else {
        int a = -1, b = -1;
        rep(i, n) {
            if (a == -1 && g[i].size() == 4) {
                a = i;
            } else if (g[i].size() == 4) {
                b = i;
            }
        }
        //std::cout << a << " " << b << std::endl;
        std::cout << solve(g, a, b) << std::endl;
        return 0;
    }

    return 0;
}


Measured memory_bytes: 11136