public static int bitwiseAnd(int N, int K)
  {
    int max = 0;
    int compare = 0;
    for(int i = 1; i<N; i++)
      for(int j = i+1; j<=N; j++)
      {
        compare = i&j;
        max = max < compare && compare < K ? compare : max;
      }
    return max;
  }

def bitwiseAnd(N, K):
    max_val = 0
    for i in range(K-2,N):
        for j in range(i+1,N+1):
            val = i&j
            if val == K-1:
                return val
            if max_val<val<K:
                max_val = val
    return max_val

public static int bitwiseAnd(int N, int K) {
        int max = Integer.MIN_VALUE;
        for(int i=1;i<=N;i++){
            for(int j=i+1;j<=N;j++){
                int result = i&j;
                if(result < K && result > max) {
                    max = result;
                }
            }
        }
        return max;
    }

function bitwiseAnd(N, K) {
    let max = 0;
    
    for(let i = 1; i <= N; i++) {
        for(let j = N; j > i; j--) {
            let bitAndOp = i & j;
            if(bitAndOp > max && bitAndOp < K ) {
                max = bitAndOp;
            }
        }
    }
    
    return max;
}