#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)


int main(){
  int Q; cin >> Q;
  vector<vector<int>> ans;
  while(Q--){
    int N,T; cin >> N >> T;
    if(N%2 == 0){
      if(T%2 == 1) ans = {};
      else{
        ans.assign(N,vector<int>(N,0));
        rep(i,N) ans[0][i] = ans[i][0] = T/2;
      }
    }
    else{
      if(T%2 == 1){
        if(N-2 > T) ans = {};
        else{
          ans.assign(N,vector<int>(N,1));
          rep(i,N) ans[0][i] = ans[i][0] = (T-(N-2))/2;
        }
      }
      else{
        ans.assign(N,vector<int>(N,0));
        rep(i,N) ans[0][i] = ans[i][0] = T/2;
      }
    }

    if(ans.empty()){ cout << "No\n"; }
    else{
      cout << "Yes\n";
      rep(i,N) rep(j,i){
        cout << (j+1) << " " << (i+1) << " " << ans[j][i] << "\n";
      }
    }
  }
  return 0;
}

/*

struct Item{ ll A,B; };
bool compItem(Item l, Item r){
  return false;
}

int N;
vector<Item> A;

int main(){
  cin >> N;
  A.resize(N);
  rep(i,N) cin >> A[i].A >> A[i].B;
  return 0;
}
*/

struct ios_do_not_sync{
  ios_do_not_sync(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
  }
} ios_do_not_sync_inst;