You are given an array having integers and an integer . Find the length of the longest non-empty subsequence of the array such that the Bitwise AND of the elements of the subsequence is greater than or equal to . Print if no such subsequence exists.
A subsequence is a sequence that can be derived from the given sequence by deleting zero or more elements without changing the order of the remaining elements.
Input format
Output format
For each test case, print if no subsequence satisfies the given condition. Otherwise, print the length of the longest non-empty subsequence in a separate line.
Constraints