#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define ll long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define repl(i,a,b) for(ll i=(a);i<(b);i++)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

template <typename T> bool chmin(T &a,T b){if(a>b){a=b;return true;} return false;}
template <typename T> bool chmax(T &a,T b){if(a<b){a=b;return true;} return false;}


void solve(){
  int n,k; cin >> n >> k;
  if(k == 1 || k == n){
    cout << "No" << "\n";
    return;
  }
  cout << "Yes" << "\n";
  vector<int> a(n),b(n),c(n);
  a[0]=c.back()=1,a.back()=b[0]=2,b.back()=c[0]=3;
  rep(i,1,k) a[i]=n+2-k+i;
  rep(i,k,n-1) a[i]=4+(n-2-i);
  rep(i,1,k) b[i]=2*n-k+i;
  rep(i,k,n-1) b[i]=n+2+(n-2-i);
  rep(i,1,k) c[i]=3*n-2-k+i;
  rep(i,k,n-1) c[i]=2*n+(n-2-i);
  rep(i,0,n) cout << a[i] << " ";
  cout << "\n";
  rep(i,0,n) cout << b[i] << " ";
  cout << "\n";
  rep(i,0,n) cout << c[i] << " ";
  cout << "\n";

  return;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int T; cin >> T;
  while(T--) solve();
}