UVALive 4727 Jump

#include<bits/stdc++.h>
using namespace std;

const int maxn = 5e5+1;
int f[maxn][3];

//#define LOCAL
int main()
{
#ifdef LOCAL
    freopen("in.txt","r",stdin);
#endif
    int T; cin>>T;
    f[1][0] = 0;
    while(T--){
        int n,k; scanf("%d%d",&n,&k);
        for(int i = 2; i <= 3; i++) {
            bool exs[3] = {};
            for(int j = 0; j < i-1; j++){
                f[i][j] = (f[i-1][j]+k)%i;
                exs[f[i][j]] = true;
            }
            for(int j = 0; j < i; j++){
                if(!exs[j]) { f[i][i-1] = j; break; }
            }
        }
        for(int i = 4; i <= n; i++){
            for(int j = 0; j < 3; j++){
                f[i][j] = (f[i-1][j]+k)%i;
            }
        }
        for(int j = 2; j >= 0; j--){
            printf("%d%c",f[n][j]+1,j?‘ ‘:‘\n‘);
        }
    }
    return 0;
}