#include <bits/stdc++.h>
using namespace std;

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;
    while (t--)
    {
        long long n, x;
        cin >> n >> x;
        if (x == 1)
        {
            cout << n * (n + 1) / 2 << '\n';
            continue;
        }
        if (n == 1)
        {
            cout << 0 << '\n';
            continue;
        }
        vector<int> path;
        while (x > 1)
        {
            path.push_back(x & 1);
            x >>= 1;
        }
        reverse(path.begin(), path.end());
        auto dfs1 = [&](auto &dfs1, long long n, int dep)
        {
            if (dep == path.size())
                return n;
            return path[dep] ? dfs1(dfs1, n / 2, dep + 1) : dfs1(dfs1, (n + 1) / 2, dep + 1);
        };
        auto dfs2 = [&](auto &dfs2, long long l, long long r, int dep)
        {
            if (dep == path.size())
                return (r - l + 1) * (l + r) / 2;
            long long res = 0;
            if (!path[dep])
                l++, r++;
            res = dfs2(dfs2, l / 2, r / 2, dep + 1) * 2;
            if (l % 2 == 1)
                res -= dfs1(dfs1, l / 2, dep + 1);
            if (r % 2 == 0)
                res -= dfs1(dfs1, r / 2, dep + 1);
            return res;
        };
        cout << dfs2(dfs2, 1, n, 0) << '\n';
    }
}