/+ dub.sdl:
    name "C"
    dependency "dcomp" version=">=0.3.2"
    lflags "-stack_size" "100000000"
+/

import std.algorithm, std.conv, std.range, std.stdio;

// import dcomp.scanner;

int[128][1001] dp;
int calcBase(int n, int d) {
    if (n == 1) return d;
    if (dp[n][d] != -1) return dp[n][d];
    int ans = 0;
    foreach (i; 0..128) {
        ans = max(ans, calc(n-1, d^i) + i);
    }
    return dp[n][d] = ans;
}

alias calc = memoSeq!calcBase;

template memoSeq(alias pred) {
    import std.traits : ReturnType, ParameterTypeTuple;
    import std.typecons : tuple, Tuple;
    alias R = ReturnType!pred;
    alias Args = ParameterTypeTuple!pred;
    R memoSeq(Args args) {
        static R[Tuple!(Args)] memo; // (1)
        auto t = tuple(args);
        auto p = t in memo;
        if (p) return *p; // (2)
        auto r = pred(args); 
        memo[t] = r; // (4)
        return r;
    }
}

int main(string[] argv) {
    auto sc = new Scanner();
    int t;
    sc.read(t);
    foreach (i; 0..1001) {
        dp[i][] = -1;
    }
    foreach (unused; 0..t) {
        int n, d;
        sc.read(n, d);
        writeln(calc(n, d));
    }
    return 0;
}
/* IMPORT /Users/yosupo/Program/dcomp/source/dcomp/scanner.d */
// module dcomp.scanner;

class Scanner {
    import std.stdio : File, stdin;
    import std.conv : to;
    import std.range : front, popFront, array, ElementType;
    import std.array : split;
    import std.traits : isSomeChar, isStaticArray, isArray; 
    import std.algorithm : map;
    File f;
    this(File f = stdin) {
        this.f = f;
    }
    string[] buf;
    private bool succ() {
        while (!buf.length) {
            if (f.eof) return false;
            buf = f.readln.split;
        }
        return true;
    }
    private bool readSingle(T)(ref T x) {
        if (!succ()) return false;
        static if (isArray!T) {
            alias E = ElementType!T;
            static if (isSomeChar!E) {
                //string or char[10] etc
                x = buf.front;
                buf.popFront;
            } else {
                static if (isStaticArray!T) {
                    //static
                    assert(buf.length == T.length);
                }
                x = buf.map!(to!E).array;
                buf.length = 0;                
            }
        } else {
            x = buf.front.to!T;
            buf.popFront;            
        }
        return true;
    }
    int read(T, Args...)(ref T x, auto ref Args args) {
        if (!readSingle(x)) return 0;
        static if (args.length == 0) {
            return 1;
        } else {
            return 1 + read(args);
        }
    }
}

unittest {
    import std.path : buildPath;
    import std.file : tempDir;
    import std.algorithm : equal;
    import std.stdio : File;
    string fileName = buildPath(tempDir, "kyuridenanmaida.txt");
    auto fout = File(fileName, "w");
    fout.writeln("1 2 3");
    fout.writeln("ab cde");
    fout.writeln("1.0 1.0 2.0");
    fout.close;
    Scanner sc = new Scanner(File(fileName, "r"));
    int a;
    int[2] b;
    char[2] c;
    string d;
    double e;
    double[] f;
    sc.read(a, b, c, d, e, f);
    assert(a == 1);
    assert(equal(b[], [2, 3]));
    assert(equal(c[], "ab"));
    assert(equal(d, "cde"));
    assert(e == 1.0);
    assert(equal(f, [1.0, 2.0]));
}
