1 #include <stdio.h>
 2 #define sq(a) ((a) * (a))
 3 int main()
 4 {
 5     int t;
 6     while (scanf_s("%d", &t) != EOF)
 7     {
 8         while (t--)
 9         {
10             long long cx, cy, cr[2], tx[3], ty[3], dis[3], flag = 0;
11             scanf_s("%lld%lld%lld%lld%lld%lld%lld%lld%lld", &cx, &cy, &cr[0], &tx[0], &ty[0], &tx[1], &ty[1], &tx[2], &ty[2]);
12             cr[1] = sq(cr[0]);
13             for (int i = 0; i < 3; ++i)
14             {
15                 dis[i] = sq(tx[i] - cx) + sq(ty[i] - cy);
16                 if (dis[i] > cr[1]) flag += 1;
17                 else if (dis[i] == cr[1])
18                 {
19                     flag = 1;
20                     break;
21                 }
22             }
23             if (3 == flag)
24             {
25                 flag = 0;
26                 for (int i = 0; i < 3; ++i)//判断点到线段的距离
27                 {
28                     if (sq(tx[i] - tx[(i + 1) % 3]) + sq(ty[i] - ty[(i + 1) % 3]) + dis[i] > dis[(i + 1) % 3]
29                         && sq(tx[i] - tx[(i + 1) % 3]) + sq(ty[i] - ty[(i + 1) % 3]) + dis[(i + 1) % 3] > dis[i])//余弦定理
30                         if (sq((ty[i] - ty[(i + 1) % 3])*cx + (tx[(i + 1) % 3] - tx[i])*cy + tx[i] * ty[(i + 1) % 3] - tx[(i + 1) % 3] * ty[i])
31                             <= (sq(ty[i] - ty[(i + 1) % 3]) + sq(tx[i] - tx[(i + 1) % 3]))*cr[1])//点到直线公式
32                         {
33                             flag = 1;
34                             break;
35                         }
36                 }
37
38             }
39             switch (flag)
40             {
41             case 0:
42                 printf("No\n");
43                 break;
44             case 1:case 2:
45                 printf("Yes\n");
46                 break;
47             }
48         }
49     }
50     return 0;
51 }