#include<bits/stdc++.h>
using namespace std;


using Graph=vector<vector<int>>;
int main(){
    int n,m;
    cin>>n>>m;
    vector<int> d(n);
    Graph g(n);
    for(int i=0;i<m;i++){
        int a,b;
        cin>>a>>b;
        a--,b--;
        d[a]++,d[b]++;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    for(int i=0;i<n;i++){
        if(d[i]%2==1){
            cout<<"No"<<endl;
            return 0;
        }
    }

    vector<int> fv;
    for(int i=0;i<n;i++){
        if(d[i]>=6){
            cout<<"Yes"<<endl;
            return 0;
        }
        if(d[i]==4){
            fv.push_back(i);
        }
    }
    if(fv.size()>=3){
        cout<<"Yes"<<endl;
        return 0;
    }
    else if(fv.size()<=1){
        cout<<"No"<<endl;
        return 0;
    }
    
    function<bool(int,int)> dfs=[&](int v,int pre){
        if(v==fv[0] && pre!=-1) return true;
        else if(v==fv[1]) return false;
        bool ret=false;
        for(auto to:g[v]){
            if(pre==to) continue;
            if(dfs(to,v)) return true;
        }
        return false;
    };
    if(dfs(fv[0],-1)){
        cout<<"Yes"<<endl;
    }else{
        cout<<"No"<<endl;
    }

    return 0;
}