#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

#define rep(i,n) for(ll i=0;i<n;++i)
#define all(a) (a).begin(),(a).end()
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }
template<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }
template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &a){
    if (a.empty()) return os;
    os << a.front();
    for (auto e : a | views::drop(1)){
        os << ' ' << e;
    }
    return os;
}

void dump(auto ...vs){
    ((cout << vs << ' '), ...) << endl;
}



void solve() {
    ll N,K;
    cin>>N>>K;
    K--;
    for (ll a=1;a<=9;a++){
        for (ll b=0;b<=9;b++){
            if (a==b)continue;
            if (K>=8*N){
                K-=8*N;
                continue;
            }
            ll l=b;
            if (a<b)l--;
            if (K<l*N){
                ll u=3+K/l;
                ll c=K%l;
                if (c>=a)c++;
                cout<<u<<' '<<a<<' '<<b<<' '<<c<<'\n';
                return;
            }
            K-=l*N;
            l=8-l;
            if (l!=0){
                ll u=N+2-K/l;
                ll c=b+1+K%l;
                if (a>b and c>=a){
                    c++;
                }
                cout<<u<<' '<<a<<' '<<b<<' '<<c<<'\n';
            }
            return;
        }
    }
    return;
}


int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll T=1;
    cin>>T;
    while (T--){
        solve();
    }
    return 0;
}