#include <bits/stdc++.h> 
 
#define pb push_back
#define F first
#define S second 
#define all(a) a.begin(),a.end()
#define pii pair <int,int>
#define Pii pair< pii , pii >
#define int long long 
using namespace std ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int maxn = 5e5 + 10  , maxq = 1e7 + 1 ,  inf = 1e9 + 10 , mod= 1e9 + 7 ,lg = 20 ; 
vector <int> pr ; 
int dp[maxn]  ;
int sl(int k){
  dp[0]= 1; 
  int ans =0 ; 
  for(int ms =0  ; ms < (1<<(int)pr.size()) ; ms++){
    if(ms){
      int x = __builtin_ctz(ms) ; 
      dp[ms] = dp[ms^(1<<x)] * pr[x] ;
    }
    ans = (ans + (__builtin_popcount(ms)%2==1 ? -1 : 1) * (k/dp[ms])) ;
  }
  return ans ; 
}

signed main(){ 
  ios::sync_with_stdio(0);cin.tie(0);  
  int T ;
  cin >> T ;
  while(T--){
    int n , k ;
    cin >> n >> k ;
    pr.clear() ;
    n+=2 ;
    int N = n ;
    for(int i= 2 ; i*i <= n ; i++){
      if(n%i==0){
        while(n%i==0)n/=i;
        pr.pb(i) ;
      }
    }
    if(n!=1)pr.pb(n) ;
    if(sl(N) < k){
      cout << -1 << "\n" ;
      continue ;
    }
    k = sl(N) - k + 1;
    int l = 0 , r = N+1 ;
    while(r-l > 1){
      int mid = (l+r)/2 ;
      if(sl(mid) >= k)r = mid ;
      else l = mid ;
    }
    int a = r , b = N-r ;
    vector <pair <int , pii> > vec ;
    while(a!=1 || b!=1){
      if(a==1){
        vec.pb({b-a , {a , b}});
        b=1 ;
        continue ;
      }
      if(b==1){
        vec.pb({a-b , {a, b}}) ;
        a=1;
        continue ;
      }
      if(a > b){
        int als = a; 
        vec.pb({(als-(a%b))/b , {a , b}});
        a%=b;
      }else{
        int bls = b; 
        vec.pb({(bls-(b%a))/a , {a , b}});
        b%=a;
      }
    } 
    vec.pb({0 , {1 , 1}});
    cout << vec.size()-1 << " " << (vec[0].S.F == vec[1].S.F) << "\n"; 
    for(int i =0 ; i < vec.size()-1 ; i++){
      cout << vec[i].F << " ";
    }
    cout << endl;
  }

}