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

int T, n, k;

int main() {
	scanf("%d", &T);
	while (T--) {
		scanf("%d%d", &n, &k); ++n;
		int tmp = n + 1;
		vector <int> pri;
		for (int i = 2; i * i <= tmp; i++) {
			if (tmp % i == 0) {
				pri.push_back(i);
				while (tmp % i == 0) tmp /= i;
			}
		}
		if (tmp > 1) pri.push_back(tmp);
		vector <int> d;
		for (int i = 1; i * i <= n + 1; i++) {
			if ((n + 1) % i == 0) {
				auto ins = [&](int x) {
					int coef = 1, xx = x;
					for (auto j : pri) {
						int cnt = 0;
						while (xx % j == 0) xx /= j, ++cnt;
						if (cnt >= 2) {
							coef = 0;
							break;
						}
						if (cnt) coef = -coef;
					}
					if (coef) d.push_back(coef * x);
				};
				ins(i);
				if (i * i != n + 1) ins((n + 1) / i);
			}
		}
		auto calc = [&](int m) {
			int ans = 0;
			for (auto i : d) {
				if (i > 0) ans += m / i;
				else ans -= m / (-i);
			}
			return ans;
		};
		if (calc(n) < k) printf("-1\n");
		else {
			int l = 1, r = n, res = n;
			while (l <= r) {
				int mid = (l + r) >> 1;
				if (calc(mid) >= k) res = mid, r = mid - 1;
				else l = mid + 1;
			}
			int x = res, y = n + 1 - res;
			vector <pair<int, int> > ans;
			while (x != 1 || y != 1) {
				if (x > y) {
					ans.emplace_back(1, (x - 1) / y);
					x -= (x - 1) / y * y;
				} else {
					ans.emplace_back(0, (y - 1) / x);
					y -= (y - 1) / x * x;
				}
			}
			printf("%d %d\n", ans.size(), ans[0].first);
			for (auto i : ans) printf("%d ", i.second);
			printf("\n");
		}
	}
	return 0;
}