#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//!  dP     dP                          dP                    !//
//!  88     88                          88                    !//
//!  88aaaaa88a .d8888b. .d8888b. .d888b88 .d8888b. 88d888b.  !//
//!  88     88  88ooood8 88'  '88 88'  '88 88ooood8 88'  '88  !//
//!  88     88  88.  ... 88.  .88 88.  .88 88.  ... 88        !//
//!  dP     dP  '88888P' '88888P8 '88888P8 '88888P' dP        !//
//!===========================================================!//
template <typename T, typename A>
std::istream& operator>>(std::istream& is, std::vector<T, A>& v)
{
    for (auto& e : v) { is >> e; }
    return is;
}
template <typename T>
T read()
{
    T v;
    return std::cin >> v, v;
}
template <typename T>
std::vector<T> readVec(const std::size_t l)
{
    std::vector<T> v(l);
    for (auto& e : v) { std::cin >> e; }
    return v;
}
using ld = long double;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr unsigned int MOD = 1000000007;
template <typename T>
constexpr T INF = std::numeric_limits<T>::max() / 4;
template <typename F>
constexpr F PI = static_cast<F>(3.1415926535897932385);
std::mt19937 mt{std::random_device{}()};
template <typename T>
bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template <typename T>
bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
template <typename T>
std::vector<T> Vec(const std::size_t n, T v) { return std::vector<T>(n, v); }
template <class... Args>
auto Vec(const std::size_t n, Args... args) { return std::vector<decltype(Vec(args...))>(n, Vec(args...)); }
template <typename T>
constexpr T popCount(const T u)
{
#ifdef __has_builtin
    return u == 0 ? T(0) : (T)__builtin_popcountll(u);
#else
    unsigned long long v = static_cast<unsigned long long>(u);
    return v = (v & 0x5555555555555555ULL) + (v >> 1 & 0x5555555555555555ULL), v = (v & 0x3333333333333333ULL) + (v >> 2 & 0x3333333333333333ULL), v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL, static_cast<T>(v * 0x0101010101010101ULL >> 56 & 0x7f);
#endif
}
template <typename T>
constexpr T log2p1(const T u)
{
#ifdef __has_builtin
    return u == 0 ? T(0) : T(64 - __builtin_clzll(u));
#else
    unsigned long long v = static_cast<unsigned long long>(u);
    return v = static_cast<unsigned long long>(v), v |= (v >> 1), v |= (v >> 2), v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32), popCount(v);
#endif
}
template <typename T>
constexpr T clog(const T v) { return v == 0 ? T(0) : log2p1(v - 1); }
template <typename T>
constexpr T msbp1(const T v) { return log2p1(v); }
template <typename T>
constexpr T lsbp1(const T v)
{
#ifdef __has_builtin
    return __builtin_ffsll(v);
#else
    return v == 0 ? T(0) : popCount((v & (-v)) - T(1)) + T(1);
#endif
}
template <typename T>
constexpr bool ispow2(const T v) { return popCount(v) == 1; }
template <typename T>
constexpr T ceil2(const T v) { return v == 0 ? T(1) : T(1) << log2p1(v - 1); }
template <typename T>
constexpr T floor2(const T v) { return v == 0 ? T(0) : T(1) << (log2p1(v) - 1); }
//!=====================================!//
//!   88888888b dP                      !//
//!   88        88                      !//
//!  a88aaaa    88 .d8888b. dP  dP  dP  !//
//!   88        88 88'  '88 88  88  88  !//
//!   88        88 88.  .88 88.88b.88'  !//
//!   dP        dP '88888P' 8888P Y8P   !//
//!=====================================!//
template <typename T>
struct Flow
{
    Flow(const std::size_t v) : V(v), edge(v) {}
    void addEdge(const std::size_t from, const std::size_t to, const T cap) { edge[from].push_back({to, edge[to].size(), cap, false}), edge[to].push_back({from, edge[from].size() - 1, 0, true}); }
    struct Edge
    {
        std::size_t to, rev;
        T cap;
        const bool isrev;
    };
    const std::vector<Edge>& operator[](const std::size_t i) const { return edge[i]; }
    friend std::ostream& operator<<(std::ostream& os, const Flow& f)
    {
        os << "[\n";
        for (std::size_t i = 0; i < f.V; i++) {
            for (const auto& e : f.edge[i]) {
                if (not e.isrev) { os << i << "->" << e.to << ":"
                                      << e.cap << "\n"; }
            }
        }
        return (os << "]\n");
    }
    const std::size_t V;
    std::vector<std::vector<Edge>> edge;
};
//!============================================================================================================!//
//! 88888888b                      dP 88888888b       dP dP                                                    !//
//! 88                             88 88              88 88                                                    !//
//! 88aaaa .d8888b. 88d888b. .d888b88 88aaaa dP    dP 88 88  .dP  .d8888b. 88d888b. .d8888b. .d8888b. 88d888b. !//
//! 88     88'  '88 88'  '88 88'  '88 88     88    88 88 88888"   88ooood8 88'  '88 Y8ooooo. 88'  '88 88'  '88 !//
//! 88     88.  .88 88       88.  .88 88     88.  .88 88 88  '8b. 88.  ... 88             88 88.  .88 88    88 !//
//! dP     '88888P' dP       '88888P8 dP     '88888P' dP dP   'YP '88888P' dP       '88888P' '88888P' dP    dP !//
//!============================================================================================================!//
template <typename T>
T FordFulkerson(Flow<T>& flow, const std::size_t s, const std::size_t t)
{
    std::vector<bool> checked(flow.V);
    auto dfs = [&](auto&& self, const std::size_t pos, const T f) -> T {
        if (pos == t) { return f; }
        checked[pos] = true;
        for (auto& e : flow.edge[pos]) {
            if (e.cap == 0 or checked[e.to]) { continue; }
            const T d = self(self, e.to, std::min(f, e.cap));
            if (d <= 0) { continue; }
            e.cap -= d, flow.edge[e.to][e.rev].cap += d;
            return d;
        }
        return 0;
    };
    T f = 0;
    while (true) {
        std::fill(checked.begin(), checked.end(), false);
        const T df = dfs(dfs, s, std::numeric_limits<T>::max());
        if (df == 0) { break; }
        f += df;
    }
    return f;
}
//!============================================!//
//!    8888ba.88ba             oo              !//
//!    88  '8b  '8b                            !//
//!    88   88   88  .d8888b.  dP  88d888b.    !//
//!    88   88   88  88'  '88  88  88'  '88    !//
//!    88   88   88  88.  .88  88  88    88    !//
//!    dP   dP   dP  '88888P8  dP  dP    dP    !//
//!============================================!//
int main()
{
    const int N = read<int>(), M = read<int>();
    std::vector<int> dim(N, 0);
    Flow<int> F(N);
    for (int i = 0, a, b; i < M; i++) { std::cin >> a >> b, a--, b--, dim[a]++, dim[b]++, F.addEdge(a, b, 1), F.addEdge(b, a, 1); }
    bool s = false;
    std::vector<int> f;
    for (int i = 0; i < N; i++) {
        if (dim[i] % 2 == 1) {
            return std::cout << "No" << std::endl, 0;
        } else if (dim[i] >= 6) {
            s = true;
        } else if (dim[i] == 4) {
            f.push_back(i);
        }
    }
    if (s or f.size() > 2) { return std::cout << "Yes" << std::endl, 0; }
    if (f.size() <= 1) { return std::cout << "No" << std::endl, 0; }
    const int S = f.front(), T = f.back();
    std::cout << (FordFulkerson(F, S, T) == 2 ? "Yes" : "No") << std::endl;
    return 0;
}


Measured memory_bytes: 15360