You are given an array of size N and a limit value K.You have to find the numbers of pairs of BITWISE OR and BITWISE AND that are stricly less than K.
For ex-:
[2,5,3],  k=6

2|5 + 2&5 =7 is greater than K
2|3 + 2&3= 5 is less than K
5|3 + 5&3= 8 is greater than K

So the answer will be 1

1<=k<=1000
1<=N<=100000