output_description: If "it" can catch the other child, print `YES`; otherwise, print `NO`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A V
      B W
      T
attempt: rd = lambda: map(int, input().split())
  a, v = rd()
  b, w = rd()
  if b < a:
      a, b, v, w = -a, -b, -v, -w
  print("YES" if int(input()) * (v - w) >= b - a else "NO")
  
problem_description: 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.
samples: [{"input": "1 2\n    3 1\n    3", "output": "YES\n    \n\n* * *"}, {"input": "1 2\n    3 2\n    3", "output": "NO\n    \n\n* * *"}, {"input": "1 2\n    3 3\n    3", "output": "NO"}]