#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

void solve(ll N,ll K){
    K--;
    for(ll a=1;a<=9;a++){
        for(ll b=0;b<=9;b++){
            if(a==b) continue;
            ll mi=0;
            for(ll c=0;c<b;c++) if(c!=a) mi++;
            vl MI;
            for(ll c=0;c<b;c++) if(c!=a) MI.pb(c);
            
            ll ma=0;
            for(ll c=b+1;c<=9;c++) if(c!=a) ma++;
            vl MA;
            for(ll c=b+1;c<=9;c++) if(c!=a) MA.pb(c);
            
            if(mi*N<=K){
                K-=mi*N;
            }else{
                ll d=K/mi;
                cout<<3+mi<<" "<<a<<" "<<b<<" "<<MI[K%mi]<<"\n";
                return;
            }
            
            if(ma*N<=K){
                K-=ma*N;
            }else{
                ll d=K/ma;
                cout<<2+N-d<<" "<<a<<" "<<b<<" "<<MA[K%ma]<<"\n";
                return;
            }
        }
    }
}
int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int Q;cin>>Q;
    while(Q--){
        ll N,K;cin>>N>>K;
        solve(N,K);
    }
}