uva679

规律：对于深度为d的第n个小球，将(n-1)表示为(d-1)位的二进制数，从低位开始，如果为1向右，否则向左

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const double epos=1e-8;

int main(){

    int d,n;
    int c;
    scanf("%d",&c);
    while(c--){
        scanf("%d",&d);
        if(d==-1) break;
        scanf("%d",&n);
        --n;
        int t=1;
        for(int i=0;i<d-1;++i){
            t<<=1;
            if(n&(1<<i)) t|=1;
        }
        printf("%d\n",t);
    }




    return 0;
}