program differ_by_1_bit
  implicit none
  integer :: n, a, b, i, m, p(0:131071) = 0
  read(*,*) n, a, b
  if (mod(popcnt(a),2) == mod(popcnt(b),2)) then
    write(*,'(a)') "NO"
    stop
  end if
  m = lshift(1,n)-1
  p(0:m) = compose(n,a,b)
  write(*,'(a)') "YES"
  write(*,'(i0)',advance='no') p(0)
  do i = 1, m
    write(*,'(x,i0)',advance='no') p(i)
  end do
  write(*,*)
  stop
contains
  recursive function compose(n,a,b) result(p)
    implicit none
    integer, intent(in) :: n, a, b
    integer :: s, t, x = 0, y = 0, c = 0, i, j, k
    integer :: p(0:lshift(1,n)-1), q(0:lshift(1,n-1)-1), r(0:lshift(1,n-1)-1)
    p = 0
    if (n == 1) then
      p(0:1) = (/a,b/)
      return
    end if
    s = lshift(1,n-1)-1
    t = lshift(1,n)-1
    do i = 0, n-1
      if (btest(a,i) .eqv. btest(b,i)) cycle
      do j = 0, i-1
        if (btest(a,j)) x = ibset(x,j)
        if (btest(b,j)) y = ibset(y,j)
      end do
      k = i
      do j = i+1, n-1
        if (btest(a,j)) x = ibset(x,j-1)
        if (btest(b,j)) y = ibset(y,j-1)
      end do
      c = ibset(x,0)
      if (btest(x,0)) c = ibclr(x,0)
      exit
    end do
    q = compose(n-1,x,c)
    r = compose(n-1,c,y)
    do i = 0, s
      do j = 0, k-1
        if (btest(q(i),j)) p(i) = ibset(p(i),j)
        if (btest(r(i),j)) p(i+s+1) = ibset(p(i+s+1),j)
      end do
      if (btest(a,k)) p(i) = ibset(p(i),k)
      if (btest(b,k)) p(i+s+1) = ibset(p(i+s+1),k)
      do j = k+1, n-1
        if (btest(q(i),j-1)) p(i) = ibset(p(i),j)
        if (btest(r(i),j-1)) p(i+s+1) = ibset(p(i+s+1),j)
      end do
    end do
    return
  end function compose
end program differ_by_1_bit