#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		long long n, k; cin >> n >> k;
		k--;
		// abbbbbbc
		// a fix 9n*8;
		int a = k / (n * 72) + 1;
		k %= (n * 72);
		// b fix n*8
		int b = k / (n * 8);
		if (b >= a)b++;
		k %= (n * 8);
		// k番目
		vector<int>x, y;
		rep(i, 10)if (i != b && i != a) {
			if (i < b)x.push_back(i);
			else y.push_back(i);
		}
		int c, d;
		if (k < (long long)x.size() *n) {
			c = x[k%x.size()];
			d = 1 + k / (x.size());
		}
		else {
			k -= (long long)x.size() *n;
			c = y[k%y.size()];
			d = n - k / y.size();
		}
		cout << d + 2 << " " << a << " " << b << " " << c << endl;
	}
	return 0;
}