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

typedef complex<double> P;

int main(){
	int n;
	cin >> n;
	while(n--){
		double x,y,r,X,Y,R;
		cin >> x >> y >> r >> X >> Y >> R;
		double d = hypot(x-X,y-Y);
		if( d+R < r - 1e-9 ) {
			cout << 2 << endl;
		}else if(d+r < R - 1e-9) {
			cout << -2 << endl;
		}else if( d > r + R + 1e-9 ){
			cout << 0 << endl;
		}else{
			cout << 1 << endl;
		}
		
	}
}
### Prompt

Please provide a CPP coded solution to the problem described below:

You are given circle $A$ with radius $r_a$ and with central coordinate $(x_a, y_a)$ and circle $B$ with radius $r_b$ and with central coordinate $(x_b, y_b)$.

Write a program which prints:

* "2" if $B$ is in $A$,
* "-2" if $A$ is in $B$,
* "1" if circumference of $A$ and $B$ intersect, and
* "0" if $A$ and $B$ do not overlap.



You may assume that $A$ and $B$ are not identical.



Input

The input consists of multiple datasets. The first line consists of an integer $N$ ($N \leq 50$), the number of datasets. There will be $N$ lines where each line represents each dataset. Each data set consists of real numbers:

$x_a$ $y_a$ $r_a$ $x_b$ $y_b$ $r_b$

Output

For each dataset, print 2, -2, 1, or 0 in a line.

Example

Input

2
0.0 0.0 5.0 0.0 0.0 4.0
0.0 0.0 2.0 4.1 0.0 2.0


Output

2
0

### Response

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

typedef complex<double> P;

int main(){
	int n;
	cin >> n;
	while(n--){
		double x,y,r,X,Y,R;
		cin >> x >> y >> r >> X >> Y >> R;
		double d = hypot(x-X,y-Y);
		if( d+R < r - 1e-9 ) {
			cout << 2 << endl;
		}else if(d+r < R - 1e-9) {
			cout << -2 << endl;
		}else if( d > r + R + 1e-9 ){
			cout << 0 << endl;
		}else{
			cout << 1 << endl;
		}
		
	}
}
```