Mikasa（位运算）

链接

You are given two integers n and m. Find the MEX of the sequence $n\oplus 0,n\oplus 1,\dots ,n\oplus m$. Here, $\oplus$ is the bitwise XOR operator.

MEX of the sequence of non-negative integers is the smallest non-negative integer that doesn’t appear in this sequence. For example, $MEX(0,1,2,4)=3$, and $MEX(1,2021)=0$.

Input

The first line contains a single integer $t(1\le t\le 30000)$ — the number of test cases.

The first and only line of each test case contains two integers $n$ and $m$ $(0\le n,m\le 10^9)$.

Output

For each test case, print a single integer — the answer to the problem.

Example

input

5
3 5
4 6
3 2
69 696
123456 654321

output

4
3
0
640
530866

Note

In the first test case, the sequence is $3\oplus 0,3\oplus 1,3\oplus 2,3\oplus 3,3\oplus 4,3\oplus 5$, or $3,2,1,0,7,6$. The smallest non-negative integer which isn’t present in the sequence i. e. the MEX of the sequence is $4$.

In the second test case, the sequence is $4\oplus 0,4\oplus 1,4\oplus 2,4\oplus 3,4\oplus 4,4\oplus 5,4\oplus 6$, or $4,5,6,7,0,1,2$. The smallest non-negative integer which isn’t present in the sequence i. e. the $MEX$ of the sequence is $3$.

In the third test case, the sequence is $3\oplus 0,3\oplus 1,3\oplus 2$, or $3,2,1$. The smallest non-negative integer which isn’t present in the sequence i. e. the $MEX$ of the sequence is $0$.

思路

题意为：给出 $n$ 与 $m$ ，求最小的非负整数 $k$ ，使得 $n\oplus x!=k(0\le x\le m)$。

这题可以转换为，求最小的 $k$，使得，$n\oplus x==k(m<x)$。由于异或运算的性质，也就是 $n\oplus k==x(m<x)$，$x$ 与一个尽量小的数字异或，使得结果大于 $m$。

至此，题目的难度大大降低。

使用贪心策略，可以求得一个 $k$ 使得 $n\oplus k==x(m\le x)$ (这里是 $\le$ 而非 $<$ )，可以先将 $m$ 自增，再进行贪心，恰好满足题意。

#include<bits/stdc++.h>
using namespace std;
int T,a,b;

void solve(){
	int ans=0;
	cin>>a>>b; b++;
	for(int i=31;i>=0;i--){
		if((b>>i&1)==0&&(a>>i&1)==1) break;
		if((b>>i&1)==1&&(a>>i&1)==0) ans|=1<<i;
	}
	cout<<ans<<"\n";
}

signed main(){
	ios::sync_with_stdio(false);
	for(cin>>T;T;T--) solve();
}