#![allow(non_snake_case, unused_imports, unused_must_use)] use std::io::{self, prelude::*}; use std::str; fn main() { let (stdin, stdout) = (io::stdin(), io::stdout()); let mut scan = Scanner::new(stdin.lock()); let mut out = io::BufWriter::new(stdout.lock()); macro_rules! input { ($T: ty) => { scan.token::<$T>() }; ($T: ty, $N: expr) => { (0..$N).map(|_| scan.token::<$T>()).collect::>() }; } let Q = input!(usize); for _ in 0..Q { let D = input!(isize); let K = input!(isize); let mut P = std::collections::BTreeSet::new(); for i in 0..=D { P.insert((i, D - i)); P.insert((i, -(D - i))); P.insert((-i, D - i)); P.insert((-i, -(D - i))); } let P = P.iter().map(|&p| p).collect::>(); //eprintln!("{:?}", P.clone()); let mut isok = false; for &(y, x) in P.iter() { let d2 = (y).abs() * (y).abs() + (x).abs() * (x).abs(); let mut c1 = 0; let mut c2 = 0; for &(py, px) in P.iter() { let d1 = (py).abs() * (py).abs() + (px).abs() * (px).abs(); if d2 > d1 { c1 += 1; } if d2 >= d1 { c2 += 1; } } //eprintln!("{} {} {} {} {}", x, y, c1, c2, K); if c1 < K && K <= c2 { isok = true; writeln!(out, "Yes\n{} {}", x, y); break; } } if !isok { writeln!(out, "No"); } } } struct Scanner { reader: R, buf_str: Vec, buf_iter: str::SplitWhitespace<'static>, } impl Scanner { fn new(reader: R) -> Self { Self { reader, buf_str: vec![], buf_iter: "".split_whitespace(), } } fn token(&mut self) -> T { loop { if let Some(token) = self.buf_iter.next() { return token.parse().ok().expect("Failed parse"); } self.buf_str.clear(); self.reader .read_until(b'\n', &mut self.buf_str) .expect("Failed read"); self.buf_iter = unsafe { let slice = str::from_utf8_unchecked(&self.buf_str); std::mem::transmute(slice.split_whitespace()) } } } }