void calculate_the_maximum(int n, int k) {
  //Write your code here.
  int max_and =0, max_or=0, max_xor=0, and, or, xor, i, j;
  
  for (i = 1; i < n; i++)
  {
      for (j= i+1 ; j <= n; j++)
      {
          and = i & j;
          or = i | j;
          xor = i ^ j;
          
          if ((and > max_and) && (and < k))
              max_and = and;
          if ((or > max_or) && (or < k))
              max_or = or;
          if ((xor > max_xor) && (xor < k))
              max_xor = xor;
        }
  }
  printf("%d\n%d\n%d",max_and,max_or,max_xor);
}

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
//Complete the following function.

void calculate_the_maximum(int n, int k) {
    int iand    = 0,
        ior     = 0,
        ixor    = 0;
    int imax_and    = 0,
        imax_or     = 0,
        imax_xor    = 0;
    int ii, ij;
    
    for (ii = 1; ii < n; ii++){
        for (ij = ii+1; ij <= n; ij++){
            iand    = ii & ij;
            ior     = ii | ij;
            ixor    = ii ^ ij;
            if(iand > imax_and && iand < k)
                imax_and = iand;
            
            if(ior > imax_or && ior < k)
                imax_or = ior;
            
            if(ixor > imax_xor && ixor < k)
                imax_xor = ixor;
            
        }
    } 
    
    printf("%d\n%d\n%d\n", imax_and, imax_or, imax_xor);
}

int main() {
    int n, k;
  
    scanf("%d %d", &n, &k);
    calculate_the_maximum(n, k);
 
    return 0;
}

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

void calculate_the_maximum(int n, int k);
int mand=0,mor=0,mxor=0;

int main() {
    int n, k;
  
    scanf("%d %d", &n, &k);
   calculate_the_maximum(n, k);
   
   printf("%d\n%d\n%d",mand,mor,mxor);
 
    return 0;
}

void calculate_the_maximum(int n, int k)
{
   for (int i=1;i<=n;i++) 
   {
       for (int j=i+1;j<=n;j++)
       {
           if((i&j)<k && (i&j)>=mand)
           {
              mand=i&j; 
           }
            if((i|j)<k && (i|j)>=mor)
           {
              mor=i|j;
           }
            if((i^j)<k && (i^j)>=mxor)
           {
              mxor=i^j;
           }
       }
   } 
    
}

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
//Complete the following function.


void calculate_the_maximum(int n, int k) {
  //Write your code here.
  int i,j,v,x,y,m=0;
  int and[50],or[50],xor[50];
  int p,q,r;
  for(i=1;i<n;i++)
  {
      for (j=i+1; j<=n; j++) 
      {
        v=(i&j);
        if(v<k){
            and[m]=v;
        }
        x=(i|j);
        if (x<k) {
        or[m]=x;
        }
        y=(i^j);
        if (y<k) {
        xor[m]=y;
        }
        m++;
        
      }
  }

  p=0;
  for(i=0;i<sizeof(and)/sizeof(int);i++){
      if(and[i]>p){
          p=and[i];
      }
  }
   q=0;
  for(i=0;i<sizeof(or)/sizeof(int);i++){
      if(or[i]>q){
          q=or[i];
      }
  }
   r=0;
  for(i=0;i<sizeof(xor)/sizeof(int);i++){
      if(xor[i]>r){
          r=xor[i];
      }
  }
  
  printf("%d\n %d\n %d\n",p,q,r);
  
}

int main() {
    int n, k;
  
    scanf("%d %d", &n, &k);
    calculate_the_maximum(n, k);
 
    return 0;
}