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
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.util.*;
import java.io.*;

public class Main {
	public static void main(String[] args) {
		try {
			System.setIn( new FileInputStream("src/aoj0023/input.txt"));	
			System.setOut( new PrintStream( new FileOutputStream("src/aoj0023/result.txt")));
		} catch (FileNotFoundException e) {
		}
		new Main().run();
	}
	void run() {
		Scanner sc = new Scanner(System.in);
		for (int N = sc.nextInt(); N > 0; N--) {
			System.out.println(solve(sc.nextDouble(),sc.nextDouble(),sc.nextDouble(),
					sc.nextDouble(),sc.nextDouble(),sc.nextDouble()));
		}
	}
	
	double EPS = 1e-8;

	int solve(double xa, double ya, double ra, double xb, double yb, double rb) {
		double dist = hypot(xa - xb, ya - yb);
		if (dist > ra + rb + EPS)
			return 0;
		else if (ra > rb) {
			if (dist + rb < ra)
				return 2;
		} else if (ra < rb) {
			if (dist + ra < rb)
				return -2;
		}
		return 1;
	}
	
	void debug(Object...os) {
		System.err.println(deepToString(os));
	} 
}