#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#define ALL(x) (x).begin(),(x).end()
#define ll long long
#define ull unsigned long long
#define pii_ pair<int,int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define show1(a) cout<<#a<<" = "<<a<<endl
#define show2(a,b) cout<<#a<<" = "<<a<<"; "<<#b<<" = "<<b<<endl
using namespace std;
const ll INF = 1LL<<60;
const int inf = 1<<30;
const int maxn = 2e6+5;
const ll B = 4e12;
inline void fastio() {ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
bool vis[maxn];
vector<int> prime;
inline ll gcd(ll a,ll b) {return b==0?a:gcd(b,a%b);}
inline ll exgcd(ll a,ll b,ll &x,ll &y)
{
ll d;
if(!b) d=a,x=1,y=0;
else {d=exgcd(b,a%b,y,x);y-=a/b*x;}
return d;
}
void init()
{
int n = 2e6;
rep(i,2,n){
if(!vis[i]) prime.pb(i);
for(ll j=(ll)i*i;j<=n;j+=i) vis[j] = 1;
}
}
int main()
{
int _; init();
ll a,b,c,d,e,f;
for(scanf("%d",&_);_;_--){
scanf("%lld%lld",&a,&b);
if(b==1){
printf("-1 -1 -1 -1\n");
}else{
ll k = gcd(a,b);
if(k > 1){
a/=k,b/=k;
d = b,f = b;
c = a+1,e = 1;
printf("%lld %lld %lld %lld\n",c,d,e,f); continue;
}else{
if(!vis[b]){ // ab互质且b为质数
printf("-1 -1 -1 -1\n"); continue;
}
for(int x:prime){
if(b%x==0){
d = 1;
while(b%x==0) d*=x,b/=x;
break;
}
}
if(b==1){ // 只有一种质因子
printf("-1 -1 -1 -1\n"); continue;
}
f = b;
exgcd(f,d,c,e);
if(c<0){
ll k = abs(c)/d+1;
c += k*d,e -= k*f;
}
printf("%lld %lld %lld %lld\n",c*a,d,-e*a,f);
}
}
}
return 0;
}