#include void solve() { long long int n, k; scanf("%lld %lld", &n, &k); k--; long long int a, b, c, l; a = k / (72 * n) + 1; k %= 72 * n; b = k / (8 * n); k %= 8 * n; if (a <= b) b++; long long int s = b; if (a < b) s--; if (s * n > k) { l = k / s + 1; c = k % s; if (a <= c) c++; if (b <= c) c++; } else { k -= s * n; s = 8 - s; l = n - k / s; c = k % s + b + 1; if (b < a && a <= c) c++; } printf("%lld %lld %lld %lld\n", l + 2, a, b, c); return; } int main() { int t; scanf("%d", &t); for (; t > 0; t--) solve(); return 0; }