#include<bits/stdc++.h>
using namespace std;

void solve(){
	using ll=long long;
	ll n,k;
	cin>>n>>k;
	k--;
	vector<tuple<int,int>> vt;
	for (int a=1;a<=9;a++) for (int b=0;b<=9;b++){
		if (a==b) continue;
		vt.push_back({a,b});
	}
	sort(vt.begin(),vt.end());
	ll r=k/(8*n);
	k%=8*n;
	auto [a,b]=vt[r];
	ll d1=b,d2=9-b;
	if (a<b) d1--;
	else d2--;
	ll sz,c;
	if (k<d1*n){
		sz=k/d1+1;
		int c2=k%d1;
		for (c=0;c<=b;c++){
			if (a==c||b==c) continue;
			if (c2==0) break;
			c2--;
		}
	}
	else{
		k-=d1*n;
		sz=n-k/d2;
		int c2=k%d2;
		for (c=b;c<=9;c++){
			if (a==c||b==c) continue;
			if (c2==0) break;
			c2--;
		}
	}
	cout<<sz+2<<" "<<a<<" "<<b<<" "<<c<<endl;
}

int main(){
	int t;
	cin>>t;
	while (t--) solve();
}