#include<cstdio>

#include<cstdlib>

#include<algorithm>

#include<cstring>

#define MAXN 500005

using namespace std;

int f[MAXN][];

int n,k;

void solve(){

    scanf("%d%d",&n,&k);

    int b[]={};

    int t=-;

    for(int i=;i>=;i--){

        for(int j=;j<=k;j++){

            (t+=)%=;

            while(b[t]){

                (t+=)%=;

            }

        }

        f[][i]=t;

        b[t]=;

    }

    for(int i=;i<=n;i++){

        for(int j=;j<=;j++){

            f[i][j]=(f[i-][j]+k)%i;

        }

    }

    printf("%d %d %d\n",f[n][]+,f[n][]+,f[n][]+);

}

int main()

{

//    freopen("data.in","r",stdin);

    int T;

    scanf("%d",&T);

    while(T--){

        solve();

    }

    return ;

}