/*
  Problem #3  --  Stanford Local Programming Contest - 2003
  Solution by manku@stanford.edu
*/

#include <stdio.h>
#include <stdlib.h>

void numbits(int k, int x, int y)
{
   int d, c=0 ;
   
   d = (y-x+(1<<k)) % (1<<k) ;
   
   while (d)
      c+=(d%2), d>>=1 ;

   fprintf (stdout, "%d ", c) ;
   return ;
}

int  dist (int k, int x, int y)
{
   int d = (y-x + (1<<k)) % (1<<k) ;
   int e = (1<<k) - d ;

   if (d < e)
      return d ;
   return e ;
}

void greedy (int k, int x, int y)
{
   int d = dist (k, x, y) ;
   int len = 0 ;
   int dmin, xmin, i, xx, dd ;

   while (d)
   {
      dmin = d ;
      xmin = x ;
      for (i = 0; i < k; i++)
      {
         xx = (x + (1<<i) + (1<<k)) % (1<<k) ;
         dd = dist (k, xx, y) ;
         if (dd < dmin)
            dmin = dd, xmin = xx ;

         xx = (x - (1<<i) + (1<<k)) % (1<<k) ;
         dd = dist (k, xx, y) ;
         if (dd < dmin)
            dmin = dd, xmin = xx ;         
      }

      x = xmin ;
      d = dmin ;
      len ++ ;
   }
   
   fprintf (stdout, "%d\n", len) ;
   return ;
}

int main(int argc, char *argv[])
{
   int k, x, y ;
   
   while (fscanf (stdin, "%d %d %d", &k, &x, &y) == 3)
   {
      numbits (k, x, y) ;
      numbits (k, y, x) ;
      greedy (k, x, y) ;
   }
   
   return 0 ;
}