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.
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if (w - v) * t >= (b - a):
  print('YES')
else:
  print('NO')
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if (a >= b):
  a, b = b, a
if (b + (w * t)) <= (a + (v * t)):
  print('YES')
else:
  print('NO')
