#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

void solve() {
  int n, t; cin >> n >> t;
  if (n == 2) {
    if (t % 2 == 0) {
      cout << "Yes\n" << 1 << ' ' << 2 << ' ' << t / 2 << '\n';
    } else {
      cout << "No\n";
    }
  } else if (n == 3) {
    vector<vector<int>> graph{
      {-1, t,  0},
      {t,  -1, 0},
      {0,  0,  0}
    };
    cout << "Yes\n";
    REP(i, n) FOR(j, i + 1, n) cout << i + 1 << ' ' << j + 1 << ' ' << graph[i][j] << '\n';
  } else {
    for (int a = 0; a * 2 <= t; ++a) {
      if ((t - a * 2) % (n - 2) == 0) {
        int b = (t - a * 2) / (n - 2);
        cout << "Yes\n";
        FOR(j, 1, n) cout << 1 << ' ' << j + 1 << ' ' << a << '\n';
        FOR(i, 1, n) FOR(j, i + 1, n) cout << i + 1 << ' ' << j + 1 << ' ' << b << '\n';
        return;
      }
    }
    cout << "No\n";
  }
}

int main() {
  int q; cin >> q;
  while (q--) solve();
  return 0;
}