#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;

int Q, D, K;

double dist(int x, int y) {
  return sqrt(x * x + y * y);
}

void solve() {
  cin >> D >> K;
  vector<pair<double, pair<int, int>>> vec;
  set<pair<int, int>> st;
  for (int x = -D; x <= D; x++) {
    int y = D - abs(x);
    double d = dist(x, y);
    if (st.count({x, y}) == 0) {
      vec.push_back({d, {x, y}});
      st.insert({x, y});
    }
    y = abs(x) - D;
    d = dist(x, y);
    if (st.count({x, y}) == 0) {
      vec.push_back({d, {x, y}});
      st.insert({x, y});
    }
  }
  if (vec.size() < K) {
    cout << "No" << endl;
  } else {
    cout << "Yes" << endl;
    sort(vec.begin(), vec.end());
    cout << vec[K - 1].second.first << ' ' << vec[K - 1].second.second << endl;
  }
}

int main(void){
  cin >> Q;
  while(Q--) {
    solve();
  }
}