#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
#define range(x) (x).begin(), (x).end()

struct Point {
    ll x, y;
    Point() {};
    Point(ll x, ll y)
        : x(x), y(y)
    {
    }
    Point operator-(Point B)
    {
        return Point(x - B.x, y - B.y);
    }
};

ll Cross(Point a, Point b)
{
    return a.x * b.y - a.y * b.x;
}
int sgn(ll x)
{
    if (x < 0)
        return -1;
    else if (x == 0)
        return 0;
    else
        return 1;
}

ll Dot(Point a, Point b)
{
    return a.x * b.x + a.y * b.y;
}
bool Cross_segment(Point a, Point b, Point c, Point d)
{
    // cout << c.x << ' ' << c.y << ' ' << d.x << ' ' << d.y << '\n';
    ll c1 = Cross(b - a, c - a), c2 = Cross(b - a, d - a);
    ll d1 = Cross(d - c, a - c), d2 = Cross(d - c, b - c);
    bool flag = sgn(c1) * sgn(c2) <= 0 && sgn(d1) * sgn(d2) <= 0;
    if (!flag)
        return false;
    if (Cross(b - a, c - d) == 0) {
        if (a.x > b.x)
            swap(a, b);
        if (c.x >= a.x && c.x <= b.x)
            return true;
        if (d.x >= a.x && d.x <= b.x)
            return true;
        if (c.x > d.x)
            swap(c, d);
        swap(a, c), swap(b, d);
        if (c.x >= a.x && c.x <= b.x)
            return true;
        if (d.x >= a.x && d.x <= b.x)
            return true;
        return false;
    }
    return true;
}

void solve()
{
    int x, y, r, vx, vy;
    cin >> x >> y >> r >> vx >> vy;

    int lx, ly, rx, ry;
    cin >> lx >> ly >> rx >> ry;

    lx += r, ly += r;
    rx -= r, ry -= r;
    if (rx < lx || ry < ly) {
        cout << "No\n";
        return;
    }

    Point a(x, y);
    ll cnt = 0;
    if (vx && vy)
        cnt = min(10000000 / abs(vx), 10000000 / abs(vy));
    else if (vx)
        cnt = 10000000 / abs(vx);
    else
        cnt = 10000000 / abs(vy);
    x += cnt * vx;
    y += cnt * vy;
    Point b(x, y);

    // cout << a.x << ' ' << a.y << ' ' << b.x << ' ' << b.y << '\n';

    Point cka(lx, ly), ckb(lx, ry);

    if (Cross_segment(a, b, cka, ckb)) {
        cout << "Yes\n";
        return;
    }
    ckb.x = rx, ckb.y = ly;
    if (Cross_segment(a, b, cka, ckb)) {
        cout << "Yes\n";
        return;
    }
    ckb.x = rx, ckb.y = ry;
    cka.x = lx, cka.y = ry;
    if (Cross_segment(a, b, cka, ckb)) {
        cout << "Yes\n";
        return;
    }
    cka.x = rx, cka.y = ly;
    if (Cross_segment(a, b, cka, ckb)) {
        cout << "Yes\n";
        return;
    }

    cout << "No\n";
}

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

    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}