import Data.Bits
import qualified Data.Vector.Unboxed as V
import Data.List
import Data.Monoid

path :: Int -> [Int] -> V.Vector Int
path 1 [k] = V.fromList [0,2^k]
path n (k:ks) = let v = path (n - 1) ks
                    (v0,v1) = V.splitAt (2^(n-2)) v
                    y = V.last v0 `xor` (2^k)
                in v0 <> V.map (`xor` y) v <> v1

parseInts :: String -> [Int]
parseInts s = case reads s of
                [(x,t)] -> x : parseInts t
                _ -> []

main = do
  [n,a,b] <- parseInts <$> getLine
  let c = a `xor` b
  if popCount c == 1
    then do putStrLn "YES"
            let k = countTrailingZeros c
            putStrLn $ intercalate " " $ map (show . xor a) $ V.toList $ path n (filter (/= k) [0..n-1] ++ [k])
    else putStrLn "NO"
