Jump LA4727

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <algorithm>
#include <vector>
#include <cstring>
#include <stack>
#include <cctype>
#include <utility>   
#include <map>
#include <string>  
#include <climits> 
#include <set>
#include <string> 
#include <sstream>
#include <utility>
#include <ctime>
 
using std::priority_queue;
using std::vector;
using std::swap;
using std::stack;
using std::sort;
using std::max;
using std::min;
using std::pair;
using std::map;
using std::string;
using std::cin;
using std::cout;
using std::set;
using std::queue;
using std::string;
using std::istringstream;
using std::make_pair;
using std::greater;
using std::endl;

int main()
{
	int T;
	scanf("%d", &T);
	while(T--)
	{
		int n, k;
		scanf("%d%d", &n, &k);
		int t1 = k%2;
		t1 = (t1+k)%3;
		int t2 = ((k-1)%2+k)%3;
		int t3 = 3-t1-t2;
		for(int i = 4; i <= n; ++i)
		{
			t1 = (t1+k)%i;
			t2 = (t2+k)%i;
			t3 = (t3+k)%i;
		}
		printf("%d %d %d\n", t3+1, t2+1, t1+1);
	}
	return 0;
}