/**
	author:  shobonvip
	created: 2026.02.20 22:12:51
**/

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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

void solve() {
	ll n, k;
	cin >> n >> k;
	k--;
	
	ll f1 = k / (72 * n) + 1;
	ll k1 = k % (72 * n);
	ll f2 = k1 / (8 * n);
	if (f2 >= f1) f2++;

	vector<int> toie(10);
	toie[f1]++;
	toie[f2]++;
	
	ll mai = 0;
	ll ato = 0;
	rep(i,0,f2) if (toie[i]==0) mai++;
	rep(i,f2+1,10) if (toie[i]==0) ato++;

	ll k2 = k1 % (8 * n);
	ll siz = 0;
	ll f3;

	if (k2 < mai * n) {
		siz = k2 / mai + 3;
		f3 = k2 % mai;
		ll po = f3;
		ll var = 0;
		rep(i,0,f2) {
			if (toie[i]==0) {
				if (var == po) {
					break;
				}
				var++;
			} else {
				f3++;
			}
		}

	} else {
		siz = (8 * n - 1 - k2) / ato + 3;
		f3 = (k2 - mai * n) % ato;
		ll po = f3;
		ll var = 0;
		rep(i,f2 + 1,10) {
			if (toie[i] == 0) {
				if (var == po) {
					f3 = i;
					break;
				}
				var++;
			}
		}
	}

	cout << siz << ' ' << f1 << ' ' << f2 << ' ' << f3 << '\n';




}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int t; cin >> t;
	while(t--) solve();
}