// binary trie をイメージすれば
// その部分木内の頂点は内部で連結にするのが最適
// 片方fullに埋まってるような場合は簡単
// 両方そうじゃないパターンが問題
//

use std::io::Write;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn run() {
    input! {
        t: usize,
        ask: [(u64, u64); t],
    }
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    for (n, m) in ask {
        let mut l = m;
        let mut r = m + n;
        let mut ans = 0u64;
        let mut x = false;
        let mut y = false;
        let mut i = 0;
        let mut add = 0;
        while l < r {
            if l & 1 == 1 {
                ans += add;
                if x {
                    ans += 1 << i;
                }
                x = true;
                l += 1;
            }
            if r & 1 == 1 {
                ans += add;
                r -= 1;
                if y {
                    ans += 1 << i;
                }
                y = true;
            }
            l >>= 1;
            r >>= 1;
            add = 2 * add + (1 << i);
            i += 1;
        }
        let mid = l << i;
        let l = m;
        let r = m + n;
        if l < mid && mid < r {
            let x = (mid - l).next_power_of_two();
            let y = (r - mid).next_power_of_two();
            let v = x.max(y);
            ans += ((2u64 << mid.trailing_zeros()) - 1) / v * v;
            /*
            let mut val = std::u64::MAX;
            for i in l..mid {
                for j in mid..r {
                    val = val.min(i ^ j);
                }
            }
            ans += val;
            */
        }
        writeln!(out, "{}", ans).ok();
    }
}

fn main() {
    run();
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[macro_export]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[macro_export]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------