import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } int[][] solve(const(int) N, const(int) T) { auto ans = new int[][](N, N); if (T % 2 == 0) { foreach (v; 1 .. N) { ans[0][v] = ans[v][0] = T / 2; } } else if ((T - (N - 2)) % 2 == 0) { foreach (v; 1 .. N) { ans[0][v] = ans[v][0] = (T - (N - 2)) / 2; } foreach (u; 1 .. N) foreach (v; u + 1 .. N) { ans[u][v] = ans[v][u] = 1; } } else { return null; } return ans; } void main() { try { for (; ; ) { const numCases = readInt(); foreach (caseId; 0 .. numCases) { const N = readInt(); const T = readInt(); const ans = solve(N, T); if (ans) { writeln("Yes"); foreach (u; 0 .. N) foreach (v; u + 1 .. N) { writeln(u + 1, " ", v + 1, " ", ans[u][v]); } } else { writeln("No"); } } } } catch (EOFException e) { } }