Problem:
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.

Sample Input 1

1 2
3 1
3

Sample Output 1

YES

Sample Input 2

1 2
3 2
3

Sample Output 2

NO

Sample Input 3

1 2
3 3
3

Sample Output 3

NO

Solution in Ruby (2.7.1) (judge verdict: Wrong Answer)

lines = []
while line = gets
    lines << line.chomp.split(' ')
end
 v=lines[1][1].to_i-lines[0][1].to_i
 left=-v*lines[2][0].to_i
  right=lines[1][0].to_i-lines[0][0].to_i

if lines[0][0].to_i<lines[1][0].to_i
	if left>=right
 	  print 'YES'
	else
  	 print 'NO'
	end
else
  if left<right
   print 'YES'
	else
   print 'NO'
end
end