#include<iostream>
#include<cstdio>
#include<cmath>
#define N 1000
#define inf 2e9
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
int gcd(int x,int y)
{
    if (!y) return x;
    return gcd(y,x%y);
}
int T,n,k,leng,st[N+1],length,tong[N+1];
long long res;
void solve(int x,int y)
{
    if (x==1&&y==1) return;
    if (x<y) tong[++length]=(y-1)/x,solve(x,y-(y-1)/x*x);
    else tong[++length]=(x-1)/y,solve(x-(x-1)/y*y,y);
    return;
}
void dfs(int x,int d,int dres,int tres)
{
    if (x==leng+1)
    {
	res+=d/dres*tres;
	return;
    }
    dfs(x+1,d,dres,tres),dfs(x+1,d,dres*st[x],-tres);
    return;
}
int calc(int x)
{
    res=0,dfs(1,x,1,1);
    return res;
}
int main()
{
    int x,rt;
    T=read();
    while (T--)
    {
	n=read(),x=n+2,k=read(),length=leng=0;
	for (int i=2;i*i<=n+2;++i)
	    if (x%i==0)
	    {
		st[++leng]=i;
		while (x%i==0) x/=i;
	    }
	if (x!=1) st[++leng]=x;
	if (k>calc(n+1))
	{
	    puts("-1");
	    continue;
	}
	rt=0;
	for (int i=log(inf)/log(2);i>=0;--i)
	    if (rt+(1<<i)<=n+1&&calc(rt+(1<<i))<k)
		rt+=(1<<i);
	rt++,solve(rt,n+2-rt);
	printf("%d %d\n",length,rt>n+2-rt);
	for (int i=1;i<=length;++i) printf("%d ",tong[i]);
	puts("");
    }
    return 0;
}