시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
0.5 초 512 MB 0 0 0 0.000%

문제

You are standing at position $(0, 0)$ on the plane and want to pass the ball to your teammate standing at $(x_t, y_t)$. Unfortunately, there is a player from the opposing team in position $(x_o, y_o)$ who wants to intercept this pass.

A player gets the ball at a certain moment if their positions on the plane coincide at that moment. Both players can move with speed $s_p$, and you can make the ball fly with constant speed $s_b$. Note that, at some moment, the ball will touch the ground and the friction will stop it, so there is no case when players can't catch the ball at all, but for simplicity we assume that it will happen far far away.

Your task is to determine whether you can make a pass to your teammate, that is, throw the ball so that your teammate gets to it faster than the opponent. Output "+" (without quotes) if you can make such a pass that your teammate will be the first to get the ball, "0" if you can't, but you can make such a pass that both players will get the ball simultaneously, and "-" otherwise.

입력

The first line contains an integer $n$ ($n \leq 10^5$): the number of test cases. Each of the following $n$ lines describes a separate test case and contains six integers $x_t, y_t, x_o, y_o, s_b, s_p$ ($-75 \leq x_t, y_t, x_o, y_o \leq 75$; $1 \leq s_b, s_p \leq 75$): coordinates of the teammate, coordinates of the opponent, and speeds of the ball and players, respectively. Your position, the teammate's position, and the opponent's position are pairwise different.

출력

Output $n$ answers on a single line without spaces.

예제 입력 1

3
1 0 2 0 1 1
0 3 0 -1 1 2
75 0 2 0 1 10

예제 출력 1

+0-