// 那就是希望。
// 即便需要取模，也是光明。

#ifdef MYEE
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#endif

// 打了个表
// [Done] exited with code=0 in 148.246 seconds
// [Done] exited with code=0 in 88.832 seconds
// [Done] exited with code=0 in 44.381 seconds

#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
std::vector<uint>Sol[200005];
voi update(uint B){
    if(Sol[B].size())return;
    bol ok=false;
    for(uint p=2;!ok;p++){
        std::vector<uint>P;for(uint i=0;i<p;i++)P.push_back(i);
        while(!ok&&std::next_permutation(P.begin(),P.end())){
            if(P.back()==p-1)continue;
            for(uint S=1;!ok&&S<(1u<<(p-1));S++){
                std::vector<bol>Gone(p);
                std::vector<llt>Ans(p);
                ok=true;
                for(uint i=0;ok&&i<p;i++)if(!Gone[i]){
                    uint j=i,t=0;llt a=1,b=0,x;std::vector<std::pair<llt,llt> >V;
                    do 
                        V.push_back({a,b}),a*=2,b=2*b+(j?S>>(j-1)&1:0)-(S>>j&1?(llt)B:0),j=P[j];
                    while(j!=i);
                    x=b/(1-a);if(x<0||x>=B||b!=x*(1-a)){ok=false;break;}
                    do
                        Ans[j]=x*V[t].first+V[t].second,t++,Gone[j]=1,j=P[j];
                    while(j!=i);
                }
                if(ok)for(uint i=0;i<p;i++)ok&=S>>i&1?Ans[i]*2+(i?S>>(i-1)&1:0)>=B&&Ans[i]<B:Ans[i]>=0&&Ans[i]*2+(i?S>>(i-1)&1:0)<B;
                if(ok)for(uint i=0;i<p;i++)Sol[B].push_back(Ans[i]);
            }
        }
    }
}
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
	Sol[1135]={832,529,1059,983,302,605,75,151,};
	Sol[8191]={2152,4304,417,835,1670,6681,5171,3340,};
	Sol[8380]={6145,3910,7821,7262,2234,4469,558,1117,};
	Sol[18145]={13306,8467,16935,15725,4838,9677,1209,2419,};
	Sol[24256]={6373,12746,1236,2473,4946,19785,15314,9892,};
	Sol[32131]={3081,6162,12324,24648,17165,2200,17606,4401,8803,};
	Sol[32635]={23932,15229,30459,28283,8702,17405,2175,4351,};
	Sol[40195]={29476,18757,37515,34835,10718,21437,2679,5359,};
	Sol[48385]={35482,22579,45159,41933,12902,25805,3225,6451,};
	Sol[52165]={38254,24343,48687,45209,13910,27821,3477,6955,};
	Sol[56386]={14815,29630,2874,5749,11498,45993,35600,22996,};
	Sol[58150]={42643,27136,54273,50396,15506,31013,3876,7753,};
	Sol[64135]={47032,29929,59859,55583,17102,34205,4275,8551,};
	Sol[64261]={7168,14336,28672,57344,50427,36594,35714,8928,17857,};
	Sol[66151]={37615,9079,18159,36318,25941,6485,51883,12970,};
	Sol[72010]={52807,33604,67209,62408,19202,38405,4800,9601,};
	Sol[72136]={34229,68458,64780,57425,42715,53182,13295,26591,};
	Sol[72640]={53269,33898,67797,62954,19370,38741,4842,9685,};
	Sol[80011]={75304,70597,61184,42358,4706,9413,18826,37652,};
	Sol[80641]={30675,61350,42059,3478,6957,55658,13914,27829,};
	Sol[81145]={59506,37867,75735,70325,21638,43277,5409,10819,};
	Sol[88390]={64819,41248,82497,76604,23570,47141,5892,11785,};
	Sol[92170]={67591,43012,86025,79880,24578,49157,6144,12289,};
	Sol[96265]={70594,44923,89847,83429,25670,51341,6417,12835,};
	Sol[98155]={71980,45805,91611,85067,26174,52349,6543,13087,};
	Sol[100171]={89957,79743,59316,18462,95064,73851,36925,47532,};
	Sol[112141]={105544,98947,85754,59368,6596,13193,26386,52772,};
	Sol[120016]={17414,34828,69656,19296,38593,68715,77186,34357,};
	Sol[120205]={88150,56095,112191,104177,32054,64109,8013,16027,};
	Sol[120646]={31699,63398,6150,12301,24602,98409,76172,49204,};
	Sol[129151]={100788,72425,15700,31401,122060,114969,125605,62802,};
	Sol[136270]={99931,63592,127185,118100,36338,72677,9084,18169,};
	Sol[136396]={64721,129442,122488,108581,80767,100558,25139,50279,};
	Sol[140176]={13193,26386,52772,105544,70912,6596,1649,3298,};
	Sol[144271]={135784,127297,110324,76378,8486,16973,33946,67892,};
	Sol[146161]={16049,32098,64196,128392,110623,75086,8024,4012,};
	Sol[152020]={111481,70942,141885,131750,40538,81077,10134,20269,};
	Sol[152146]={22076,44152,88304,24462,48925,87111,97850,43555,};
	Sol[160021]={92247,24473,126134,48947,97895,143077,71538,35769,};
	Sol[160651]={53131,106262,51873,103747,53445,46843,106891,93686,26722,};
	Sol[168211]={24407,48814,97628,27045,54091,96309,108182,48154,};
	Sol[169156]={1990,3980,7960,85573,127364,15920,31841,63682,};
	Sol[176275]={129268,82261,164523,152771,47006,94013,11751,23503,};
	Sol[180181]={43102,86204,172408,164635,149090,118000,111641,55820,};
	Sol[184150]={135043,85936,171873,159596,49106,98213,12276,24553,};
    // for(uint B=2;B<=200000;B++){
    //     update(B);
    //     if(B%1000==0)fprintf(stderr,"Now:%u\n",B),fflush(stderr);
    // }
    // for(uint i=2;i<=200000;i++){
    //     printf("\n%u:%u ",i,(uint)Sol[i].size());
    //     for(auto s:Sol[i])printf("%u,",s);
    //     if(Sol[i].size()>=8)
    //     {
    //         fprintf(stderr,"\tSol[%u]={",i);
    //         for(auto s:Sol[i])fprintf(stderr,"%u,",s);
    //         fprintf(stderr,"};\n");
    //     }
    // }
    uint t;scanf("%u",&t);
    while(t--){
        uint n,B;scanf("%u%u",&n,&B),update(B);
        if(Sol[B].size()>n)puts("-1");
        else{
            std::vector<uint>Ans=Sol[B];
            uint t=0;
            while(Ans[t]*2<B)t++;
            Ans.insert(Ans.begin()+t+1,n-Ans.size(),B-1);
            for(uint i=Ans.size()-1;~i;i--)
                printf("%u%c",Ans[i]," \n"[!i]);
        }
    }
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。