#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<iomanip>
using namespace std;
 
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
 
class Point{
    public:
        double x, y;
 
        Point(double x = 0, double y = 0): x(x), y(y) {}
 
        Point operator + (Point p){ return Point(x + p.x, y + p.y);}
        Point operator - (Point p){ return Point(x - p.x, y - p.y);}
        Point operator * (double a){ return Point(a * x, a * y);}
        Point operator / (double a){ return Point(x / a, y / a);}
 
        double abs(){ return sqrt(norm());}
        double norm(){ return x * x + y * y;}
 
        bool operator < (const Point &p) const{
            return x != p.x ? x < p.x : y < p.y;
        }
 
        bool operator == (const Point &p) const{
            return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
        }
};
 
class Circle{
    public:
        Point c;
        double r;
        Circle(Point c = Point(), double r = 0.0): c(c), r(r) {}
};
 
double getDistance(Point a, Point b){
    return (a - b).abs();
}
 
int main(){
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++){
        Circle a, b;
        cin >> a.c.x >> a.c.y >> a.r >> b.c.x >> b.c.y >> b.r;
        if(a.r > (b.r + getDistance(a.c, b.c))) cout << 2 << endl;
        else if(b.r > (a.r + getDistance(a.c, b.c))) cout << -2 << endl;
        else if(a.r + b.r < getDistance(a.c, b.c)) cout << 0 << endl;
        else cout << 1 << endl;
    }
    return 0;
}
