#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int T;
ll N,K;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>T;
	while(T--) {
		cin>>N>>K;
		ll V[10][10][10]={};
		for(i=1;i<=9&&K;i++) {
			FOR(j,10) if(i!=j&&K) {
				ll v=N*8;
				if(K>v) {
					K-=v;
					continue;
				}
				
				vector<int> L,M;
				FOR(k,10) if(k!=i&&k<j) L.push_back(k);
				FOR(k,10) if(k!=i&&k>j) M.push_back(k);
				int num=L.size();
				if(num) {
					if(K<=N*num) {
						ll len=(K-1)/num;
						int d=L[(K-1)%num];
						cout<<len+2<<" "<<i<<" "<<j<<" "<<d<<endl;
						K=0;
						break;
					}
					K-=N*num;
				}
				num=M.size();
				ll len=(K-1)/num;
				int d=M[(K-1)%num];
				cout<<(N-len)+2<<" "<<i<<" "<<j<<" "<<d<<endl;
				K=0;
				break;
				
				
			}
		}
		
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}