#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;struct Point{double x,y;Point(double x = 0,double y = 0):x(x),y(y){} // 构造函数，方便代码编写
};
typedef Point Vector;  //从程序实现上，Vector只是Point的别名struct Circle{Point c;double r;Circle(Point c,double r):c(c),r(r){}Point getPoint(double a){return Point(c.x+cos(a)*r,c.y+sin(a)*r);}
};//返回切线的条数。-1表示无穷条切线
//a[i]和b[i]分别是第i条切线在圆A和圆B上的切点
int getTangents(Circle A,Circle B){int cnt = 0;if(A.r < B.r)swap(A,B);int d2 = (A.c.x-B.c.x)*(A.c.x-B.c.x)+(A.c.y-B.c.y)*(A.c.y-B.c.y);int rdiff = A.r-B.r;int rsum = A.r+B.r;if(d2 < rdiff*rdiff)return 0;       //内含if(d2==0 && A.r==B.r)return -1;      //无限条切线if(d2 == rdiff*rdiff){//内切，1条切线return 1;}//有外公切线cnt += 2;if(d2 == rsum*rsum){//一条公切线++cnt;}else if(d2 > rsum*rsum){//两条公切线cnt += 2;}return cnt;
}int main(){int T;scanf("%d",&T);while(T--){Point p1,p2;double r1,r2;scanf("%lf%lf%lf",&p1.x,&p1.y,&r1);Circle c1(p1,r1);scanf("%lf%lf%lf",&p2.x,&p2.y,&r2);Circle c2(p2,r2);printf("%d\n",getTangents(c1,c2));}return 0;
}

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;int dp[5005];
int w[505],v[505];int main(){int T;scanf("%d",&T);while(T--){int n,b;int sum = 0;scanf("%d%d",&n,&b);for(int i = 0; i < n; ++i){scanf("%d%d",&w[i],&v[i]);sum += v[i];}for(int i = 1; i <= sum; ++i)dp[i] = INF;dp[0] = 0;for(int i = 0; i < n; ++i){for(int j = sum; j >= v[i]; --j){if(dp[j-v[i]] != INF){dp[j] = min(dp[j],dp[j-v[i]]+w[i]);}}}for(int i = sum; i >= 0; --i){if(dp[i] <= b){printf("%d\n",i);break;}}}return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;typedef long long ll;struct Poly{ll a[1005];Poly operator + (const Poly &p) const{Poly tmp = {0};for(int i = 0; i < 1005; ++i){tmp.a[i] = (a[i]+p.a[i])%1000000007;}return tmp;}Poly operator * (const Poly &p) const{Poly tmp = {0};for(int i = 0; i < 1005; ++i){if(a[i] == 0)continue;for(int j = 0; j < 1005; ++j){if(p.a[j] == 0)continue;tmp.a[i+j] += a[i]*p.a[j];tmp.a[i+j] %= 1000000007;}}return tmp;}
}pstk[1005];char ostk[1005] = {'#'};
int ptop,otop,pri[350];
char str[1005];void push(char op){if(ostk[otop]=='#' && op=='#')return;if(ostk[otop]=='(' && op==')'){--otop;return;}if(pri[ostk[otop]]<pri[op] || ostk[otop]=='('){ostk[++otop] = op;return;}if(ostk[otop--] == '+'){Poly p = pstk[ptop]+pstk[ptop-1];ptop -= 2;pstk[++ptop] = p;}else{Poly p = pstk[ptop]*pstk[ptop-1];ptop -= 2;pstk[++ptop] = p;}push(op);
}void output(Poly &p){int i = 1000;while(i>=0 && p.a[i] == 0)--i;if(i == -1){puts("0");return;}for(int j = i; j >= 0; --j){printf("%lld",p.a[j]);if(j)putchar(' ');}putchar('\n');
}int main(){pri['+'] = 2; pri['*'] = 3;pri['('] = 4; pri[')'] = 1;pri['#'] = 1;int T;scanf("%d",&T);while(T--){scanf("%s",str);ptop = 0; otop = 1;for(int i = 0; str[i]; ++i){if(str[i]>='0' && str[i]<='9'){Poly p = {0};p.a[0] = str[i]-'0';pstk[++ptop] = p;}else if(str[i]=='x'){Poly p = {0};p.a[1] = 1;pstk[++ptop] = p;}else{push(str[i]);}}push('#');output(pstk[ptop]);}return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;const int N = 100005;
int a[N],pre[N];void solve(int n,int m){for(int i = 1; i <= n; ++i)pre[i] = pre[i-1]+(!a[i]);int ans = 0;int j = 1;for(int i = 1; i <= n; ++i){for(; j <= n; ++j){if(pre[j]-pre[i-1] > m)break;}if(j-i > ans){ans = j-i;}}printf("%d\n",ans);
}int main(){int T;scanf("%d",&T);while(T--){memset(a,0,sizeof(a));int x,n,m;scanf("%d%d",&n,&m);int k = 0;for(int i = 0; i < n; ++i){scanf("%d",&x);if(!x) k++;a[x] = 1;}solve(m,k);}return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;const int N = 2005;
char str[N];
int dp[(1<<16)+10];int main(){int T;scanf("%d",&T);while(T--){int n,m;scanf("%d%d",&n,&m);scanf("%s",str);memset(dp,0,sizeof(dp));for(int i = 0; i < n; ++i){int tmp = 0;for(int j = i; j < n; ++j){tmp |= 1<<(str[j]-'a');dp[tmp] = max(dp[tmp],j-i+1);}}int len = 1<<m;for(int i = 0; i < len; ++i){for(int j = 0; j < m; ++j){if((1<<j) & i)dp[i] = max(dp[i],dp[i^(1<<j)]);}}int ans = 0;for(int i = 0; i < len; ++i){ans = max(ans,dp[i]*dp[(len-1)^i]);}printf("%d\n",ans);}return 0;
}

#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;priority_queue<int,vector<int>,greater<int> > q;int main(){int T;scanf("%d",&T);while(T--){int x,n,m,k;scanf("%d%d%d",&n,&m,&k);for(int i = 0; i < n; ++i){scanf("%d",&x);q.push(x);}while(n > m){q.pop();q.push(q.top()+k);q.pop();--n;}while(q.size() != 1)q.pop();printf("%d\n",q.top());q.pop();}return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;const int N = 100005;
int n,k;
int a[N],l[N],r[N];
bool vis[N];struct node{int l,r,val;node(int _l,int _r):l(0),r(0){l = _l;r = _r;val = a[_l]+a[_r];}bool operator < (const node& no) const{return val < no.val;}
};int main(){int T;scanf("%d",&T);while(T--){scanf("%d%d",&n,&k);for(int i = 1; i <= n; ++i)scanf("%d",&a[i]);if(n == 0){if(k == 0 || k == 1)printf("0\n");elseprintf("%d\n",4+(k-2)*5);continue;}if(n == 1){printf("%d\n",a[1]+1+(k-1)*5);continue;}memset(vis,false,sizeof(vis));for(int i = 1; i <= n; ++i){l[i] = i-1;r[i] = i+1;}r[0] = 1;l[n+1] = n;priority_queue<node> q;for(int i = 1; i < n; ++i)q.push(node(i,i+1));bool put = false;int sum = 0,last = n;while(!q.empty() && k > 0){node cur = q.top(); q.pop();if(cur.val <= 3 && put == true)break;int ll = cur.l,rr = cur.r;if(vis[ll] || vis[rr])continue;sum += (a[ll]+a[rr]+2);last -= 2;--k;vis[ll] = true; vis[rr] = true;int _l = l[ll], _r = r[rr];l[_r] = _l;r[_l] = _r;put = true;if(_l!=0 && _r!= n+1)q.push(node(_l,_r));}if(k>0 && last==1 && a[r[0]]>3){sum += a[r[0]] + 2;--k;}sum += k*5;printf("%d\n",sum);}return 0;
}

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;int main(){int T;scanf("%d",&T);while(T--){int n,m;scanf("%d%d",&n,&m);int cnt1 = n/3;n -= cnt1;int cnt2 = n/2;if(cnt1+cnt2+2 <= m)puts("No");elseputs("Yes");}return 0;
}