#pragma GCC optimize("O3")
#include<bits/stdc++.h> 
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>; 
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1,0,1,0},dx={0,-1,0,1};
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LCM(ll c,ll d){return c/GCD(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T>void debag(const vector<T> &a){cerr<<"debag :";for(auto v:a)cerr<<v<<" ";cerr<<"\n";}
template<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<" ";cout<<"\n";}
void solve(){
      int n,m;
      cin>>n>>m;
      if(m%2==0){
            cout<<"Yes"<<"\n";
            for(int i=1;i<=n;i++){
                   for(int j=i+1;j<=n;j++){
                           if(i==1)cout<<i<<" "<<j<<" "<<m/2<<"\n";
                           else cout<<i<<" "<<j<<" "<<0<<"\n";
                   }
            }
      }else{
            if(n==2){
                  cout<<"No"<<"\n";
                  return;
            }
            bool able=false;
            int a=0,b=0;
            for(int i=0;i<=100;i++){
                   if((n-2)*i<=m&&(m-(n-2)*i)%2==0){
                          able=true;
                          a=(m-(n-2)*i)/2;
                          b=i;
                   }
            }
            if(!able){
                  cout<<"No"<<"\n";
                  return;                 
            }
            cout<<"Yes"<<"\n";
            for(int i=1;i<=n;i++){
                   for(int j=i+1;j<=n;j++){
                           if(i==1)cout<<i<<" "<<j<<" "<<a<<"\n";
                           else cout<<i<<" "<<j<<" "<<b<<"\n";
                   }
            }
      }
}
int main(){
      int t;
      cin>>t;
      while(t--)solve();
}