import std;

void main () {
    int Q = readln.chomp.to!int;
    foreach (_; 0..Q) {
        int D, K; readln.read(D, K);
        solve(D, K);
    }
}

void solve (int D, int K) {
    // マンハッタン距離Dの点集合を列挙
    alias coord = Tuple!(int, "y", int, "x");
    bool[coord] DistanceDPoints;
    for (int i = 0; i <= D; i++) {
        int y = D-i;
        int x = i;
        DistanceDPoints[coord(y, x)] = true;
        DistanceDPoints[coord(y, -x)] = true;
        DistanceDPoints[coord(-y, x)] = true;
        DistanceDPoints[coord(-y, -x)] = true;
    }

    int[] dist;
    foreach (key, val; DistanceDPoints) {
        dist ~= key.y^^2 + key.x^^2;
    }

    dist.sort;

    // 二分探索
    int f (int idx) {
        if (idx < 0) return -int.max;
        if (dist.length <= idx) return int.max;
        return dist[idx];
    }

    foreach (key, val; DistanceDPoints) {
        int EuclidDist = key.y^^2 + key.x^^2;
        {
            int ok = 0, ng = cast(int) dist.length;
            while (1 < abs(ok-ng)) {
                int mid = (ok+ng) / 2;
                if (f(mid) <= EuclidDist) { 
                    ok = mid;
                } else {
                    ng = mid;
                }
            }
            if (ok+1 < K) continue;
        }
        {
            int ok = -1, ng = cast(int) dist.length;
            while (1 < abs(ok-ng)) {
                int mid = (ok+ng) / 2;
                if (f(mid) < EuclidDist) { 
                    ok = mid;
                } else {
                    ng = mid;
                }
            }
            if (K <= ok+1) continue;
        }

        writeln("Yes");
        writeln(key.x, " ", key.y);
        return;
    }

    writeln("No");
}

void read(T...)(string S, ref T args) {
    auto buf = S.split;
    foreach (i, ref arg; args) {
        arg = buf[i].to!(typeof(arg));
    }
}