local n, m = io.read("*n", "*n")
local ea, eb = {}, {}
local edge = {}
local len = {}
local asked = {}
for i = 1, n do
  edge[i] = {}
  len[i] = 0
  asked[i] = false
end
for i = 1, m do
  ea[i], eb[i] = io.read("*n", "*n")
  table.insert(edge[ea[i]], eb[i])
  table.insert(edge[eb[i]], ea[i])
end
local parent = {}
for i = 1, n do parent[i] = i end

local function uf_findroot(idx)
  local idx_update = idx
  while parent[idx] ~= idx do
    idx = parent[idx]
  end
  while parent[idx_update] ~= idx do
    parent[idx_update], idx_update = idx, parent[idx_update]
  end
  return idx
end

for i = 1, m do
  local a, b = ea[i], eb[i]
  local ra, rb = uf_findroot(a), uf_findroot(b)
  parent[b], parent[rb] = ra, ra
end
local root = {}
for i = 1, n do
  local r = uf_findroot(i)
  root[r] = true
end
for r, _u in pairs(root) do
  asked[r] = true
  local tasks = {r}
  local done = 0
  local f = false
  while done < #tasks do
    done = done + 1
    local src = tasks[done]
    for i = 1, #edge[src] do
      local dst = edge[src][i]
      if not asked[dst] then
        asked[dst] = true
        len[dst] = len[src] + 1
        table.insert(tasks, dst)
      else
        if (len[src] + len[dst]) % 2 == 0 then
          f = true
        end
      end
    end
  end
  if not f then print("No") os.exit() end
end
print("Yes")