题目链接：http://codeforces.com/gym/101608/problem/G

Just days before the JCPC, your internet service went down. You decided to continue your training at the ACM club at your university. Sadly, you discovered that they have changed the WiFi password. On the router, the following question was mentioned, the answer is the WiFi password padded with zeros as needed.

A subarray [l, r] of an array A is defined as a sequence of consecutive elements Al, Al + 1, ..., Ar, the length of such subarray is r - l + 1. The bitwise OR of the subarray is defined as: Al OR Al + 1 OR ... OR Ar, where OR is the bitwise OR operation (check the notes for details).

Given an array A of n positive integers and an integer v, find the maximum length of a subarray such that the bitwise OR of its elements is less than or equal to v.

Input

The first line contains an integer T (1 ≤ T ≤ 128), where T is the number of test cases.

The first line of each test case contains two space-separated integers n and v (1 ≤ n ≤ 105) (1 ≤ v ≤ 3 × 105).

The second line contains n space-separated integers A1, A2, ..., An (1 ≤ Ai ≤ 2 × 105), the elements of the array.

The sum of n overall test cases does not exceed 106.

Output

For each test case, if no subarray meets the requirement, print 0. Otherwise, print the maximum length of a subarray that meets the requirement.

Example

Input

3
5 8
1 4 5 3 1
5 10
8 2 6 1 10
4 2
9 4 5 8

Output

5
3
0

Note

To get the value of x OR y, consider both numbers in binary (padded with zeros to make their lengths equal), apply the OR operation on the corresponding bits, and return the result into decimal form. For example, the result of 10 OR 17 = 01010 OR 10001 = 11011 = 27.

 

题意: 
给定nn个数，求有最长的连续 区间长度使得区间内数的按位或小于等于给定v

 

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
#include<map>
#include<vector>
#include<set>
#include<list>
#include<stack>
#include<queue>
using namespace std;
typedef long long ll;
const int N=1e5+5;
int p[N][20];
int cnt[20];
void add(int &now,int i){
	cnt[i]++;
	if(cnt[i]==1) now+=(1<<i);
}
void dec(int &now,int i){
	cnt[i]--;
	if(cnt[i]==0) now-=(1<<i);
}
int main(){
    freopen("wifi.in","r",stdin);
    int T;
    scanf("%d",&T);
    while(T--){
    	memset(cnt,0,sizeof(cnt));
    	memset(p,0,sizeof(p));
    	int n,v;
    	scanf("%d%d",&n,&v);
    	int x;
    	int now=0;
    	int l=1;
    	int ans=0;
    	for(int r=1;r<=n;r++){
    		scanf("%d",&x);
    		for(int i=0;i<20;i++){
    			if(x&(1<<i)){
    				p[r][i]++;
    				add(now,i);;
				}
			}
			while(now>v){
				for(int i=0;i<20;i++){
					if(p[l][i]) dec(now,i);
				}
				l++;
			}
			ans=max(ans,r-l+1);
		}
		printf("%d\n",ans);
	}
	return 0;
}