#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];
    int w = (k - 1) % sum2;
    
    vector<int> v1, v2;
    for(int i = 0; i <= 9; i++){
        if(i != a && i != b){
            if(i < b) v1.push_back(i);
            else v2.push_back(i);
        }
    }
    
    int l1 = v1.size(), l2 = v2.size();
    if(w < l1 * n){
        int t = w / l1;
        int idx = w % l1;
        int last = v1[idx];
        int len = 3 + t;
        cout << len << " " << a << " " << b << " " << last << endl;
    }
	else{
        int w2 = w - l1 * n;
        int t = (n - 1) - (w2 / l2);
        int idx = w2 % l2;
        int last = v2[idx];
        int len = 3 + t;
        cout << len << " " << a << " " << b << " " << last << endl;
    }
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while(t--) solve();
    return 0;
}