#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <set>
using namespace std;
#define prev prev228
#define all(x) (x).begin(), (x).end()

int n, m;
int a, b, v[500000];
int deg[500000];
vector<int> graph[500000];

void dfs(int kek, int p)
{
    v[kek] = 1;
    for (int u : graph[kek])
    {
        if (v[u] == 0)
            dfs(u, kek);
        else if (u == a && p != a) cout << "Yes", exit(0);
    }
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    for (int i = 0; i < m; i++)
    {
        cin >> a >> b;
        deg[a]++, deg[b]++;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }
    int t = 0;
    for (int i = 1; i <= n; i++) if (deg[i] % 2 == 1) cout << "No", exit(0);
    for (int i = 1; i <= n; i++) if (deg[i] >= 6) cout << "Yes", exit(0);
    for (int i = 1; i <= n; i++) if (deg[i] >= 4) t++;
    if (t <= 1) cout << "No", exit(0);
    if (t >= 3) cout << "Yes", exit(0);
    for (int i = 1; i <= n; i++) if (deg[i] == 4) {a = i; break;}
    for (int i = n; i >= 1; i--) if (deg[i] == 4) {b = i; break;}
    v[b] = 1;
    dfs(a, -1);
    cout << "No";
}
