#include<bits/stdc++.h>
#define ll long long
#define vi vector<ll>
using namespace std;
void s_si(auto &arr)
{
    //return;
    cout <<endl<< "________________" <<endl;

    for (auto i : arr)
    {
        cout << i <<" ";
    }
    cout <<endl<< "________________"<<endl;
}
vi nxt(100,0);
void solve()
{
    ll n,m,end;
    cin >> n >>m;
    ll now=1;
    ll i;
    for(i=10;i!=98;i=nxt[i])
    {
        if(m>=now&&m<now+n*8)
        {
            break;
        }
        now+=n*8;
        
    }
    ll tail=i%10,head=i/10;
    ll cnt1=0;
    for(int x=0;x<tail;x++)
    {
        if(x!=head)
        {
            cnt1++;
        }
    }
    ll cnt2=8-cnt1;
    ll num,tar;
    if(now+cnt1*n>m)
    {
        num=(m-now)/cnt1+1;
        tar=(m-now)%cnt1+1;
        for(int i=0;i<tail;i++)
        {
            if(i==head)
            {
                continue;
            }
            tar--;
            if(tar==0)
            {
                end=i;
                break;
            }
        }
    }
    else
    {
        num=n-(m-(now+cnt1*n))/cnt2;
        tar=(m-(now+cnt1*n))%cnt2+1;
        for(int i=tail+1;i<=9;i++)
        {
            if(i==head)
            {
                continue;
            }
            tar--;
            if(tar==0)
            {
                end=i;
                break;
            }
        }
    }
    cout << num+2<<" "<<head<<" "<< tail<<" "<<end <<"\n";
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    for(int i=10;i<=97;i++)
    {
        if(i%11==0) continue;
        nxt[i]=((i+1)%11!=0)?i+1:i+2;
    }
    //s_si(nxt);
    ll t;
    cin >> t;
    while (t--)
    {
        solve();
        /* code */
    }
    
}