#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1 << 30;
const ll INF = 1LL << 60;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
#define rep(i, s, t) for (ll i = (ll)s; i < (ll)(t); i++)
#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

template <class T1, class T2>
bool chmin(T1& x, T2 y) { return x > y ? (x = y, true) : false; }
template <class T1, class T2>
bool chmax(T1& x, T2 y) { return x < y ? (x = y, true) : false; }

template <class T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <class T>
using max_heap = priority_queue<T>;

void solve() {
    ll N, K;
    cin >> N >> K;
    K--;
    ll u1 = K / (72 * N) + 1;
    K %= 72 * N;
    vector<ll> v2;
    rep(i, 0, 10) if (i != u1) v2.push_back(i);
    ll u2 = v2[K / (8 * N)];
    K %= 8 * N;
    ll cnt = 0;
    rep(i, 0, u2) if (i != u1) cnt++;
    ll sz, uu;
    vector<ll> vx, vy;
    rep(i, 0, 10) if (i != u1 && i != u2) {
        if (i < u2) vx.push_back(i);
        else vy.push_back(i);
    }
    if (K < cnt * N) {
        sz = 1 + (K / cnt + 1) + 1;
        uu = vx[K % cnt];
    } else {
        K -= cnt * N;
        sz = 1 + (N - K / (8 - cnt)) + 1;
        uu = vy[K % (8 - cnt)];
    }
    cout << sz << " " << u1 << " " << u2 << " " << uu << "\n";
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(15);
    srand(time(NULL));

    int T;
    cin >> T;
    // T = 1;
    while (T--) solve();
}