#include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 998244353; // constexpr int MOD = 1000000007; constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1}; constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}; constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; } template 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; int main() { int q; cin >> q; while (q--) { int d, k; cin >> d >> k; vector> points; FOR(x, -d, d + 1) { points.emplace_back(x, d - abs(x)); points.emplace_back(x, -(d - abs(x))); } ranges::sort(points, {}, [](const pair& p) -> int { const auto [x, y] = p; return x * x + y * y; }); points.erase(unique(points.begin(), points.end()), points.end()); if (points.size() < k) { cout << "No\n"; } else { cout << "Yes\n" << points[k - 1].first << ' ' << points[k - 1].second << '\n'; } } return 0; }