#include<stdio.h>
#include<algorithm>
typedef unsigned int uint;
typedef unsigned long long ull;
constexpr ull decode(const int &l,const int &r,const uint &x) {
    return x|((1ull<<r-l+1)-1<<l);
}
inline void solve() {
    int n,m;
    scanf("%d%d",&n,&m),--n;
    const int x(n+1>>1);
    printf("0 %llu ",(1ull<<n+1)-1);
    m-=2;
    for(int j=x;j<n&&m>0;j++) {
        printf("%llu ",decode(1,j,1)),--m;
        if(m>0) {
            printf("%llu ",decode(1,j,0)),--m;
        }
    }
    if(m>0) {
        printf("%llu ",decode(1,n,0)),--m;
    }
    for(int i=2;i<=x&&m>0;i++) {
        if(m>n-x+1<<1) {
            for(int j=x;j<=n;j++) {
                printf("%llu ",decode(i,j,1));
                printf("%llu ",decode(i,j,0));
            }
            m-=n-x+1<<1;
        }
        else {
            for(int j=x;j<=n&&m>1;j++) {
                printf("%llu ",decode(i,j,1));
                printf("%llu ",decode(i,j,0));
                m-=2;
            }
            if(m>0) {
                printf("1 "),--m;
            }
        }
    }
    if(m>0) {
        for(int j=x+1;j<=n&&m>0;j++) {
            printf("%llu ",decode(x+1,j,0)),--m;
        }
    }
    printf("\n");
}
int main() {
    int t;
    scanf("%d",&t);
    while(t--) {
        solve();
    }
    return 0;
}