--{-# LANGUAGE OverloadedStrings #-}
--{-# LANGUAGE OverloadedLists   #-}
{-# LANGUAGE BangPatterns      #-} --引数に!
{-# LANGUAGE MultiWayIf        #-}
{-# LANGUAGE TupleSections     #-}

import Data.List
import Data.Tree
import Data.Array  --変数衝突
import Data.Array.MArray
import Data.Array.ST
import Data.Graph
--import Data.Vector as V　--変数衝突
import qualified Data.Vector.Unboxed as V
import Control.Monad
import Control.Monad.State
import Control.Monad.ST
import Debug.Trace

type D s = STUArray s Int Int

loop :: Int -> Int -> D s -> [(Int,Int)] -> ST s ()
loop n m arr [] = return ()
loop n m arr ((a,b):es) = do
  readArray arr a >>= writeArray arr a .(+1)
  readArray arr b >>= writeArray arr b .(+1)
  loop n m arr es

solve :: Int -> Int -> [(Int,Int)] -> ST s Bool
solve n m es = do
  arr <- newArray (1,n) 0
  loop n m arr es
  ds <- forM [1..n] $ readArray arr
  if any (\e -> e`mod`2 == 1) ds then return False
    else if any (\e -> e >= 6) ds then return True
      else if length (filter (>=4) ds) >= 2 then return True
        else return False

main :: IO ()
main = do
  [n,m] <- map read.words <$> getLine
  es <- replicateM m $ do
     [i,j] <- map read.words <$> getLine
     return (i,j)
  putStrLn $ if runST $ solve n m es then "Yes" else "No"

mod0 :: Int -> Int
mod0 n = if n < 1000000007 then n else mod n 1000000007
