#include <stdio.h>

int powers[31];
int num=0;


int main()
{
  int a, ba, best, cnt1, cnt2, cnt3, dist, dist2, i, j, k, na, nb, x, y, t;

  while (scanf("%d %d %d", &k, &x, &y) != EOF) {
  x--;
  y--;
  powers[0] = 1;
  for (i=1; i<=k; i++)
    powers[i] = powers[i-1]*2;
  
  a = x;
  cnt1 = 0;
  while (a != y)
    {
      best = powers[k];
      for (i=0; i<k; i++)
	{
	  na = (a + powers[i])%powers[k];
	  if ((y-na+powers[k])%powers[k] < best)
	    {
	      best = (y-na+powers[k])%powers[k];
	      ba = na;
	    }
	}
      a = ba;
      cnt1++;
    }
  printf("%d ", cnt1);
 
  a = x;
  cnt2 = 0;
  while (a != y)
    {
      best = powers[k];
      for (i=0; i<k; i++)
	{
	  na = a - powers[i];
	  if (na < 0)
	    na += powers[k];
	  dist = powers[k]-((y-na+powers[k])%powers[k]);
	  if (dist == powers[k])
	    dist = 0;
	  if (dist < best)
	    {
	      best = dist;
	      ba = na;
	    }
	}
     
      a = ba;
      cnt2++;
    }
  printf("%d ", cnt2);

  a = x;
  cnt3 = 0;
  while (a != y)
    {
      best = powers[k];
      for (i=0; i<k; i++)
	{
	  na = a - powers[i];
	  if (na < 0)
	    na += powers[k];
	  dist = (y-na+powers[k])%powers[k];
	  
	  if (dist > powers[k]-dist)
	    dist = powers[k]-dist;
	 
	  if (dist < best)
	    {
	      best = dist;
	      ba = na;
	    }

	  nb = (a + powers[i])%powers[k];
	  dist = (y-nb+powers[k])%powers[k];

	  if (dist > powers[k]-dist)
	    dist = powers[k]-dist;

	  if (dist < best)
	    {
	      best = dist;
	      ba = nb;
	    }
	}
      
      a = ba;
      cnt3++;
    }
  printf("%d\n", cnt3);
  }
  return 0;
}