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

void solve(){
	int n, k;
	cin >> n >> k;
	int sum1 = 72 * n;
	int a = (k - 1) / sum1 + 1;
	k = (k - 1) % sum1 + 1;
	
	vector<int > num;
	for(int i = 0; i <= 9; i++)
		if(i != a)
			num.push_back(i);
	int sum2 = 8 * n;
	int idb = (k - 1) / sum2;
	int b = num[idb];
	k = (k - 1) % sum2 + 1;
	
	int ci = 0;
	while(1){
		int last = n - 1 - ci;
		for(int i : num){
			int cnt;
			if(i == b){
				if(last > 0)	cnt = 8 * last;
				else 	cnt = 0;
			}
			else cnt = 1;
			if(k <= cnt){
				if(i == b){
					ci++;break;
				}
				else{
					int len = 3 + ci;
					cout << len << " " << a << " " << b << " " << i << endl;
					return;
				}
			}
			else k -= cnt;
		}
	}
}
signed main()
{
    int t;
    cin >> t;
    while (t--)
    	solve();
    return 0;
}