#include using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define each(e, v) for(auto &e: v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair; using pil = pair; using pli = pair; using pll = pair; const int MOD = 1000000007; //const int MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; template bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; struct io_setup{ io_setup(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; int main(){ int T; cin >> T; while(T--){ int N, K; cin >> N >> K; vector> es(N, vector(N, 0)); if(K%2 == 0){ rep2(i, 1, N-1){ es[0][i] = es[i][0] = K/2; } } else{ if(N%2 == 0){ cout << "No\n"; return 0; } if(K < N-2){ cout << "No\n"; return 0; } rep(i, N){ rep(j, N){ if(i == 0 || j == 0) es[i][j] = es[j][i] = (K-N+2)/2; else es[i][j] = es[j][i] = 1; } } } cout << "Yes\n"; rep(j, N){ rep(i, j){ cout << i+1 << ' ' << j+1 << ' ' << es[i][j] << '\n'; } } } }