Triangle and Circle

Limits: 2 sec., 256 MiB

Given a non-degenerate triangle with side lengths A, B, C and a circle or radius R. Print two characters in a single line:

1. Print + if the triangle can be contained in the circle possible touching it or - otherwise.

2. Print + if the circle can be contained in the triangle possible touching it or - otherwise.

Input

Four integer numbers A, B, C, R separated with single spaces.

Output

Two characters in a single line.

Constraints

$1 \le \mathbf{A, B, C, R} \le 111.$

Samples