#include <iostream>
#include <algorithm>
#include <vector>
#include <string.h>
#include <set>
#include <cassert>
using namespace std;
using lint = long long;
const long mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl(long(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr start, itr goal){ for(auto i = start; i != goal; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<long> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } long C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };

vector<vector<int>> roads;
vector<int> is_in_circle;
vector<pair<int, int>> pathes;

int move(int now, int back, int cnt){
    if(is_in_circle[now] != -1){
        return is_in_circle[now];
    }
    is_in_circle[now] = cnt;
    for(int i: roads[now]){
        if(i != back){
            pathes.push_back({now, i});
            return move(i, now, cnt + 1);
        }
    }
    assert(0);
    return -1;
}

struct UnionFind
{
    vector< int > data;
    
    UnionFind(int sz)
    {
        data.assign(sz, -1);
    }
    
    bool unite(int x, int y)
    {
        x = find(x), y = find(y);
        if(x == y) return(false);
        if(data[x] > data[y]) swap(x, y);
        data[x] += data[y];
        data[y] = x;
        return(true);
    }
    
    int find(int k)
    {
        if(data[k] < 0) return(k);
        return(data[k] = find(data[k]));
    }
    
    int size(int k)
    {
        return(-data[find(k)]);
    }
};

int main(){
    int N, M;
    cin >> N >> M;
    vector<int> deg(N, 0);
    roads.resize(N);
    for(int i = 0; i < M; i++){
        int a, b;
        cin >> a >> b;
        a--, b--;
        deg[a]++;
        deg[b]++;
        roads[a].push_back(b);
        roads[b].push_back(a);
    }
    for(int i = 0; i < N; i++){
        if(deg[i] % 2){
            cout << "No" << endl;
            return 0;
        }
    }
    is_in_circle.resize(N, -1);
    int ind = move(0, -1, 0);
    set<int> roads_after[N];
    for(int i = 0; i < N; i++){
        for(int j: roads[i]){
            roads_after[i].insert(j);
        }
    }
    vector<int> pathes_points;
    for(int i = ind; i < pathes.size(); i++){
        deg[pathes[i].first]--, deg[pathes[i].second]--;
        roads_after[pathes[i].first].erase(pathes[i].second);
        roads_after[pathes[i].second].erase(pathes[i].first);
        pathes_points.push_back(pathes[i].first);
        pathes_points.push_back(pathes[i].second);
    }
    sort(all(pathes_points));
    UnionFind uf(N);
    set<int> points;
    for(int i = 0; i < N; i++){
        if(deg[i] >= 4){
            cout << "Yes" << endl;
            return 0;
        }
        for(int j: roads_after[i]){
            uf.unite(i, j);
            points.insert(i);
            points.insert(j);
        }
    }
    set<int> patterns;
    for(int i = 0; i < N; i++){
        if(roads_after[i].size()){
            patterns.insert(uf.find(i));
        }
    }
    if(patterns.size() >= 2){
        cout << "Yes" << endl;
        return 0;
    }
    int sum = 0;
    for(int i: points){
        if(upper_bound(all(pathes_points), i) - lower_bound(all(pathes_points), i)){
            sum++;
        }
    }
    if(sum >= 3){
        cout << "Yes" << endl;
        return 0;
    }
    cout << "No" << endl;
}


Measured memory_bytes: 22396