Score : $200$ points

Problem Statement

Two children are playing tag on a number line. (In the game of tag, the child called "it" tries to catch the other child.) The child who is "it" is now at coordinate $A$, and he can travel the distance of $V$ per second. The other child is now at coordinate $B$, and she can travel the distance of $W$ per second.

He can catch her when his coordinate is the same as hers. Determine whether he can catch her within $T$ seconds (including exactly $T$ seconds later). We assume that both children move optimally.

Constraints

• $-10^9 \leq A,B \leq 10^9$
• $1 \leq V,W \leq 10^9$
• $1 \leq T \leq 10^9$
• $A \neq B$
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

$A$ $V$

$B$ $W$

$T$

Output

If "it" can catch the other child, print YES; otherwise, print NO.

1 2
3 1
3

YES

1 2
3 2
3

NO

1 2
3 3
3

NO