Range OR

/**
 *    author:  compounding
 *    created: 2024-12-25 16:55:49
 **/
#include <bits/stdc++.h>
using namespace std;
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
#define NeedForSpeed                  \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);
#define int long long
#define all(x) (x).begin(), (x).end()
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vpi;
#define f first
#define s second
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define endl "\n"
const int mod = 1000000007;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
void solve()
{
    // Range OR from l to r
    int n, m;
    cin >> n >> m;
    int l = max(0LL, n - m), r = n + m, ans = 0;
    // consider each bit separately
    for (int i = 0; i < 32; i++)
    {
        int bit = 1LL << i;
        // means it has been flipped once (r - l ) >= bit, if the difference is more than the power of 2
        if ((l & bit) || (r & bit) || (r - l) >= bit)
        {
            ans |= bit;
        }
    }
    cout << ans << endl;
    return;
}

signed main()
{
    NeedForSpeed;
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}