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 (Python):
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())

if a==b:
    print("YES")
else:
    if w>=v:
        print("NO")
    else:
        if  abs(a-b)/(v-w)<=t:
            print("YES")
        else:
            print("NO")

Solution (Python):
A, S_A = map(int, input().split(' '))
B, S_B = map(int, input().split(' '))
T = int(input())

if A < B:
    is_catchable = S_A * T + A >= S_B * T + B
else:
    is_catchable = -1 * S_A * T + A <= -1 * S_B * T + B

if is_catchable:
    print('YES')
else:
    print('NO')

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

diff = abs(a - b)
move = (v - w) * t

if diff <= move:
    ans = "YES"
else:
    ans = "NO"

print(ans)

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())


if A < B:
    A_sum = A + (V * T)
    B_sum = B + (W * T)
    if A_sum >= B_sum:
        print('YES')
    else:
        print('NO')

else:
    A_sum = A - (V * T)
    B_sum = B - (W * T)
    if A_sum <= B_sum:
        print('YES')
    else:
        print('NO')

Solution (Python):
import sys
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if B - A == 0:
  print('YES')
  sys.exit()
elif B - A > 0:
  if (B + (W * T)) - (A + (V * T)) <= 0:
    print('YES')
  else:
    print('NO')
else:
  if (B - (W * T)) - (A - (V * T)) >= 0:
    print('YES')
  else:
    print('NO')

Solution (Python):
n = list(map(int,input().split()))
m = list(map(int,input().split()))
k = int(input())

if n[0] < m[0]:
    if n[0] + n[1] * k >= m[0] + m[1] * k:
        print("YES")
        exit()
elif n[0] > m[0]:
    if n[0] - n[1] * k <= m[0] - m[1] * k:
        print("YES")
        exit()

print("NO")

Solution (Python):
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
s = abs(b-a)
if (v-w) * t >= s:
  print("YES")
else:
  print('NO')

Solution (Python):

A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
idouA = 0
idouB = 0
kankaku = 0


if W >= V:
    print("NO")
else:
    idouA = V * T
    idouB = W * T
    if A < B:
        if A < 0 and B < 0:
            kankaku = abs(A) - abs(B)
        elif A >= 0 and B >= 0:
            kankaku = abs(B) - abs(A)
        elif A <= 0 and B >= 0:
            kankaku = B - A
    elif B < A:
        if A < 0 and B < 0:
            kankaku = abs(B) - abs(A)
        elif A >= 0 and B >= 0:
            kankaku = abs(A) - abs(B)
        elif A >= 0 and B <= 0:
            kankaku = A - B
            
    if(idouB + kankaku <= idouA):
        print("YES")
    else:
        print("NO")

Solution (Python):
a, v = map(int,input().split())
b, w = map(int,input().split())
t =int(input())

s = abs(b-a)
y = (v-w)

if y <= 0:
    print('NO')
else:
    m = s % y
    u = s //y
    if m == 0 and u <= t:
            print('YES')
    elif m != 0 and u + 1 <= t:
            print('YES')
    else:
        print('NO')

Solution (Python):
a,v = map(int, input().split())
b,w = map(int, input().split())
T = int(input())
if abs(b-a) <= (v-w)*T:
    print('YES')
else:
    print('NO')

Solution (Python):
a, v = map(int,input().split())
b, w = map(int,input().split())
t = int(input())
d = abs(b-a)
s = v-w

if a == b:print("YES")
elif (s*t != 0) and d <= (s*t):print("YES")
else:print("NO")

Solution (Python):
from sys import stdin,stdout
from collections import deque,defaultdict
from math import ceil,floor,inf,sqrt,factorial,gcd,log2
from copy import deepcopy
ii1=lambda:int(stdin.readline().strip())
is1=lambda:stdin.readline().strip()
iia=lambda:list(map(int,stdin.readline().strip().split()))
isa=lambda:stdin.readline().strip().split()
mod=1000000007
a,v1=iia()
b,v2=iia()
t=ii1()
if a<b:
    if a+t*v1>=b+t*v2:
        print('YES')
    else:
        print('NO')
else:
    if b-t*v2>=a-t*v1:
        print('YES')
    else:
        print('NO')

Solution (Python):
a, v= map(int, input().split())
b, w= map(int, input().split())
t = int(input())
l = abs(b-a)
s = v-w
print('YES' if l<=s*t else 'NO')

Solution (Python):
import math
A, V = map(int, input().split())  
B, W = map(int, input().split())  
T=int(input())
if  B>A:
    kyo=B-A
if A>B:
    kyo=A-B

sub=V-W
wari=0
if sub!=0 and sub>0:
    wari=math.ceil(kyo/sub)
if wari<=T and wari!=0:
    print("YES")
else:
    print("NO")

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if V <= W:
  f = False
else:
  t = abs(B - A) / (V - W)
  if t <= T:
    f = True
  else:
    f = False

print("YES" if f else "NO")

Solution (Python):


A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())







ans = "NO"
t=0

if W<V:
    if (abs(A-B) / (V-W)) <= T:
        ans = "YES"



print(ans)

Solution (Python):
a,b=map(int, input().split())
c,d=map(int, input().split())    
e = int(input())
if d-b>=0 :
    print('NO')
elif b-d>0:
    if c-a>0:
      if e*(b-d)>=(c-a):
        print('YES')
      else:
        print('NO')
    elif a-c>0:
      if e*(b-d)>=(a-c):
        print('YES')
      else:
        print('NO')

Solution (Python):
a,v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())
d = abs(a-b)
s = v - w
if s > 0 and d/s <= t:
  print("YES")
else:
  print("NO")

Solution (Python):
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if abs(B-A)>(V-W)*T:
    print('NO')
else:
    print('YES')

Solution (Python):
A, V=map(int,input().split())
B, W=map(int,input().split())
T =int(input())
D = abs(A-B)

if (V-W)*T>=D:
  print("YES")




else:
  print("NO")

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if abs(A-B) <= T*(V-W):
    print("YES")
else:
    print("NO")

Solution (Python):
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if B>=A:
    print("YES" if A+V*T>=B+W*T else "NO")
else:
    print("YES" if B-W*T>=A-V*T else "NO")

Solution (Python):
from decimal import *
FAST_IO = 1
if FAST_IO:
    import io, sys, atexit
    rr = iter(sys.stdin.read().splitlines()).next
    sys.stdout = _OUTPUT_BUFFER = io.BytesIO()
    @atexit.register
    def write():
        sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
else:
    rr = raw_input
rri = lambda: int(rr())
rrm = lambda: map(int, rr().split())

def solve(A, B, V, W, T):
    if A<B:
        la = A+V*T
        lb = B+W*T
        return la>=lb
    else:
        la = A-V*T
        lb = B-W*T
        return la<=lb





A, V = rrm()
B, W = rrm()
T = rri()
ans = solve(A, B, V, W, T)
if ans:
    print("YES")
else:
    print("NO")

Solution (Python):
a,v = list(map(int,input().split()))
b,w = list(map(int,input().split()))
t = int(input())

import sys
dis = abs(a-b)
tume = v-w 
if v <= w:
  print("NO")
  sys.exit()

if dis%tume == 0 and dis//tume <= t:
  print("YES")
elif dis <= (t-1)*tume:
  print("YES")
else:
  print("NO")

Solution (Python):
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
r=abs(a-b)
if v<=w:
 print("NO")
else:
 if r%(v-w)==0:
  if (r/(v-w))<=t:
   print("YES")
  else:
   print("NO")
 else:
  if (r//(v-w))<=t-1:
   print("YES")
  else:
   print("NO")

Solution (Python):
i = list(map(int, input().split()))
j = list(map(int, input().split()))
t = int(input())
ans = "NO"
if i[0] > j[0]: 
  i[1] = i[0] - t * i[1]
  j[1] = j[0] - t * j[1]
  if i[1] <= j[1]:
    ans = "YES"
elif i[0] < j[0]: 
  i[1] = i[0] + t * i[1]
  j[1] = j[0] + t * j[1]
  if i[1] >= j[1]:
    ans = "YES"
else:
    ans = "YES"

print(ans)

Solution (Python):
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())




dl = abs(a-b)
dv = v-w 

if dl == 0:
    print('YES')
else:
    if dv > 0:
        
        if (dl+dv-1)//abs(dv) <= t:
        
            print('YES')
        else:
            print('NO')
    else:
        print('NO')

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if T * (V - W) >= abs(A - B):
    print('YES')
else:
    print('NO')

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

distance = abs(B-A)
diff = V-W

if distance - diff * T <= 0:
    print('YES')
else:
    print('NO')

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

x = A + V * T
y = B + W * T

z = A - V * T
w = B - W * T

if A < B:
  if x >= y:
    print('YES')
  else:
    print('NO')
else:
  if z <= w:
    print('YES')
  else:
    print('NO')

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if v > w:
    if abs(a-b) <= t*(v-w):
        print("YES")
    else:
        print("NO")
else:
    print("NO")

Solution (Python):
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())

if a < 0:
    b += abs(a)
    a = 0
if b < 0:
    a += abs(b)
    b = 0

if abs(a-b) <= (v-w)*t:
    print('YES')
else:
    print('NO')

Solution (Python):
def main():
    A, V = list(map(int, input().split()))
    B, W = list(map(int, input().split()))
    T = int(input())

    distance = abs(A-B)
    speed = V - W
    if speed <= 0:
        print("NO")
        return
    
    if T * speed >= distance:
        print("YES")
        return
    else:
        print("NO")
        return
    


if __name__  == '__main__':
    main()

Solution (Python):
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
ans="NO"
if v<=w:
    ans="NO"
else:
    if a>b:
        if (a-b)%(v-w)==0:
            if (a-b)//(v-w)<=t:
                ans="YES"
        else:
            if (a-b)//(v-w)+1<=t:
                ans="YES"
    elif a<b:
        if (a-b)%(v-w)==0:
            if (b-a)//(v-w)<=t:
                ans="YES"
        else:
            if (b-a)//(v-w)+1<=t:
                ans="YES"
print(ans)

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if W>=V:
    print("NO")
else:
    tmp = (B-A)/(V-W)
    if abs(tmp) <= T:
        print("YES")
    else:
        print("NO")

Solution (Python):
A, V = (int(s) for s in input().rstrip().split())
B, W = (int(s) for s in input().rstrip().split())
T = int(input())

if (V - W) * T >= abs(A - B):
  print("YES")
else:
  print("NO")

Solution (Python):
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())


l = abs(a-b)

if v <= w:
    print('NO')
elif t >= (l/(v-w)):
    print('YES')
else:
    print('NO')

Solution (Python):
A,V = map(int,input().split(' '))
B,W = map(int,input().split(' '))
T = int(input())
if A <= B :
    print('YES' if T*V+A >= T*W+B else 'NO')
else:
    print('YES' if T*V-A >= T*W-B else 'NO')

Solution (Python):
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())

if v<=w:
    print('NO')
elif a<b:
    if (a+v*t)>=(b+w*t):
        print('YES')
    else:
        print('NO')
else:
    if (a-v*t)<=(b-w*t):
        print('YES')
    else:
        print('NO')

Solution (Python):
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
if v <= w:
    print("NO")
else:
    dis = abs(b-a)
    sp = abs(v-w)
    if 0 < dis/sp <= t:
        print("YES")
    else:
        print("NO")

Solution (Python):
import sys

orga = list(map(int, input().split()))
child = list(map(int, input().split()))
time = int(input())

speed = orga[1] - child[1]
dis = abs(orga[0] - child[0])

if speed <= 0:
    print("NO")
    sys.exit()

if dis / speed <= time:
    print("YES")
else:
    print("NO")

Solution (Python):
def resolve():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())

    dist = abs(A - B)
    dist_b = dist + W*T
    
    

    
    

    if V*T >= dist_b:
        print("YES")
    else:
        print("NO")




if __name__ == "__main__":
    resolve()

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if a <= b and a + v*t >= b + w*t:
    print("YES")
elif a > b and a - v*t <= b - w*t:
    print("YES")
else:
    print("NO")

Solution (Python):
a_v = list(map(int, input().split())) 
b_w = list(map(int, input().split())) 
t = int(input())

a = a_v[0]
v = a_v[1]
b = b_w[0]
w = b_w[1]

answer = "YES"
if w - v >= 0:
    answer = "NO"

distance = abs(b-a)
speed = abs(w-v)

if distance <= t*speed and answer != "NO":
    answer = "YES"
else:
    answer = "NO"


print(answer)

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if V > W and abs(A - B) <= abs((W - V) * T):
    print("YES")
else:
    print("NO")

Solution (Python):
import sys

a,v=map(int, input().split())
b,w=map(int, input().split())
t=int(input())
if b > a:
    dif = b - a
elif b < a:
    dif = a - b

if v <= w:
    print("NO")
    sys.exit(0)

nowdif = v - w
if dif <= nowdif * t:
    print("YES")
    sys.exit(0)

print("NO")

Solution (Python):
A,V=map(int,input().split())
B,W=map(int,input().split())
T = int(input())


if V <= W:
  print('NO')
  exit()
else:
  soutaikyori=abs(A-B)
  soutaiV=V-W
  
  if soutaikyori / soutaiV > T:
    print("NO")
    exit()
  else:
    print("YES")
    exit()
  
    
    """
    print("YES")
    exit()
    if soutaikyori%soutaiV==0:
      print("YES")
    else:
      
      amari = soutaikyori % soutaiV
      keikazikan = soutaikyori / soutaiV
      nokorizikan = T - keikazikan
      if A > B:
        A += V * keikazikan
        B += W * keikazikan
      else:
        A -= V * keikazikan
        B -= W * keikazikan

      for t in range(nokorizikan):
        
        if A == B:
          print("YES")
          exit()
        elif A > B:
          A -= V
          B -= W
        else:
          A += V
          B += W
      
      print("NO")
    """

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())


if B > A:
    if A - B + (V - W) * T >= 0:
        print("YES")
    else:
        print("NO")
else:
    if B - A + (V - W) * T >= 0:
        print("YES")
    else:
        print("NO")

Solution (Python):
A,V = [int(hoge) for hoge in input().split()]
B,W = [int(hoge) for hoge in input().split()]
T = int(input())
dist = abs(A-B)
oni = (V-W) * T
if dist <= oni:
    print("YES")
else:
    print("NO")

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if b > a:
  a_2 = v * t + a
  b_2 = w * t + b
else:
  a_2 = -v*t + a
  b_2 = -w*t + b  

if a >= b and b_2 >= a_2:
  print("YES")
  exit()
elif b >= a and a_2 >= b_2:
  print("YES")   
  exit()
else:
  print("NO")

Solution (Python):
A,V= map(int,input().split())
B,W= map(int,input().split())
T=int(input())
First=abs(A-B)
Move=W-V
if First+(Move*T)<=0:
  print("YES")
else:
  print("NO")

Solution (Python):
A,V = map(int,input().split())
B,W = map(int,input().split())
T=int(input())
if A==B:
  print("YES")
elif V<=W:
  print("NO")
elif abs(B-A)/(V-W) <= T:
  print("YES")
else:
  print("NO")

Solution (Python):


import sys

def main():
    a,v = map(int,input().split())
    b,w = map(int,input().split())
    t = int(input())

    if a == b:
        print("YES")
    elif a > b:
        if (a-v*t)-(b-w*t) <=0:
            print("YES")
        else:
            print("NO")
    else:
        if (w*t+b)-(v*t+a) <= 0:
            print("YES")
        else:
            print("NO")

if __name__ == "__main__":
    main()

Solution (Python):
A,V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if A < B:
  if (T*V+A) >= (T*W+B):
    print("YES")
  else:
    print("NO")
else:
  if  (A-T*V) <= (B-T*W):
    print("YES")
  else:
    print("NO")

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if A < B:
    A += V*T
    B += W*T
    print("YES" if A >= B else "NO")
else:
    A -= V*T
    B -= W*T
    print("YES" if A <= B else "NO")

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
d = abs(a-b)
closing_speed = v - w
print("YES" if closing_speed * t >= d else "NO")

Solution (Python):






import math
from decimal import *

a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

c = abs(Decimal(b) - Decimal(a))
d = (Decimal(v)*Decimal(t) - Decimal(w)*Decimal(t))

if d >= c:
    print("YES")

else :
    print("NO")

Solution (Python):
import bisect
import copy
import heapq
import sys
import itertools
import math
import queue
from functools import lru_cache
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7 

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]


def main():
    A, V = read_values()
    B, W = read_values()
    T = int(input())
    if V <= W:
        print("NO")
        return 
    
    print("YES" if abs(A - B) <= T * (V - W) else "NO")


if __name__ == "__main__":
    main()

Solution (Python):
import math
a,v=map(int, input().split())
b,w=map(int, input().split())
t=int(input())
x=abs(a-b)+(w-v)*t
if x<=0:
    print('YES')
else:
    print('NO')

Solution (Python):
a = input().split()
 
A = int(a[0])
V = int(a[1])
 
b = input().split()
 
B = int(b[0])
W = int(b[1])
 
T = int(input())
 
if B <0:
    B = B*-1
    A = A*-1
 
if A<B and A + V*T>= B +W*T:
    print("YES")
elif B<A and B -W*T >= A - V*T:
    print("YES")
else:
  print("NO")

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

dis = abs(max(A,B) - min(A,B))
velo = V - W
if velo <= 0:
    print('NO')
    exit()

if (dis/velo) <= T:
    print('YES')
else:
    print('NO')

Solution (Python):
import sys

a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if w >= v:
    print("NO")
    sys.exit()

d = abs(b-a)
if (v-w)*t >= d:
    print("YES")
    sys.exit()
print("NO")

Solution (Python):
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if abs(b-a)<=(v-w)*t:
    print('YES')
else:
    print('NO')

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

a_dis = V * T
b_dis = W * T
dis_diff = abs(B - A)

if dis_diff <= a_dis - b_dis:
    print('YES')
else:
    print('NO')

Solution (Python):
A, V = map(int,input().split())
B, W = map(int,input().split())
T = int(input())

S = abs(B - A)
if (V-W) * T >= S:
    print("YES")
else:
    print("NO")

Solution (Python):
A_V = input().split()
A = int(A_V[0])
V = int(A_V[1])
B_W = input().split()
B = int(B_W[0])
W = int(B_W[1])
T = int(input())
 
if V - W <= 0:
  print('NO')
elif T < abs(B-A)/(V-W):
  print('NO')
else:
  print('YES')

Solution (Python):
a=input().split()
a=[int(i) for i in a]
b=input().split()
b=[int(i) for i in b]
time=int(input())

if a[0]<b[0]:
  ans=a[0]+a[1]*time-b[0]-b[1]*time
else:
  ans=b[0]-b[1]*time-a[0]+a[1]*time

if ans>=0:
  print("YES")
else:
  print("NO")

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if v <= w:
  print('NO')
  exit(0)
if abs(a-b)%(v-w) == 0:
  f = abs(a-b)//(v-w)
else:
  f = abs(a-b)//(v-w)+1
if f <= t:
  print('YES')
else:
  print('NO')

Solution (Python):
import math

A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if W >= V:
    print("NO")
else:
    ans = math.ceil(abs(B-A)/(V-W))
    if ans <= T:
        print("YES")
    else:
        print("NO")

Solution (Python):
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())

dist = abs(a-b)
vec = v-w

if vec==0:
    print('NO')
elif vec>0 and 0<=dist/vec<=t:
    print('YES')
else:
    print('NO')

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
x = a - b
if x < 0:
  x = -x
if v > w and (v - w) * t >= x:
  print("YES")
else:
  print("NO")

Solution (Python):
import math

(a, v) = [int(s) for s in input().split()]
(b, w) = [int(s) for s in input().split()]
t = int(input())

d = abs(a - b)
d_v = abs(v - w)

if v > w and d <= d_v * t:
    print('YES')
else:
    print('NO')

Solution (Python):
a,v = map(int,input().split())
b, w= map(int,input().split())
t = int(input())
A = a+(t*v)
B = b+(t*w)
if a == b:
    print('YES')
elif a < b:
    if B <= A:
        print('YES')
    else:
        print('NO')
else:
    A = a-(t*v)
    B = b-(t*w)
    if A <= B:
        print('YES')
    else:
        print('NO')

Solution (Python):
Oni = input().split(" ")
A = int(Oni[0])
V = int(Oni[1])
child = input().split(" ")
B = int(child[0])
W = int(child[1])
T = int(input())

if V - W > 0:
    X = V - W
    Y = abs(A - B)
    if X * T >= Y:
        print("YES")
    else:
        print("NO")
else:
    print("NO")

Solution (Python):
a,v = map(int,input().split())
b,w = map(int,input().split())
t=int(input())

if a < b and a + v * t >= b + w * t:
  print('YES')
elif a > b and a - v * t <= b - w * t:
  print('YES')
else:
  print('NO')

Solution (Python):
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())

if a==b:
    print('YES')
elif v<=w:
    print('NO')
elif abs(a-b)/ abs(v-w) <= t:
    print('YES')
else:
    print('NO')

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if abs(a-b) <= (v-w)*t:
    print("YES")
else:
    print("NO")

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if v <= w:
    print("NO")
else:
    if a < b:
        time = (b-a)/(v-w)
        if time <= t:
            print("YES")
        else:
            print("NO")
    if b < a:
        time = (a-b)/(v-w)
        if time <= t:
            print("YES")
        else:
            print("NO")

Solution (Python):
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())


dis = abs(a-b)
if a < b:
    a_mov = v*t + a
    b_mov = w*t + b
    
    if b_mov <= a_mov:
        print("YES")
    else:
        print("NO")
else:
    a_mov = (-1*v)*t + a
    b_mov = (-1*w)*t + b
    
    if b_mov >= a_mov:
        print("YES")
    else:
        print("NO")

Solution (Python):
A, V = list(map(int, input().split()))
B, W = list(map(int, input().split()))
T = int(input())

if A > B:
    Ax = A - V*T
    Bx = B - W*T
    if Ax <= Bx:
        print('YES')
    else:
        print('NO')
else:
    Ax = A + V*T
    Bx = B + W*T
    if Ax >= Bx:
        print('YES')
    else:
        print('NO')

Solution (Python):
a,v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())

if a < b:
    position_A = a + (v * t)
    position_B = b + (w * t)
    if position_B <= position_A:
        print("YES")
    else:
        print("NO")
else:
    position_A = a + (-v * t)
    position_B = b + (-w * t)
    if position_B >= position_A:
        print("YES")
    else:
        print("NO")

Solution (Python):
A,V = map(int, input().split())
B,W = map(int, input().split())
T = int(input())
x = abs(A - B)
v = V - W
if v <= 0:
        print('NO')
else:
    if T < x // v:        
        print('NO')
    elif T == x // v and x % v > 0:
        print('NO')
    else:
        print('YES')

Solution (Python):
import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__

a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
distA = v*t
distB = w*t



if a < b:
    if a+distA >= b+distB:
        print("YES")
    else:
        print("NO")
else:
    if a-distA <= b-distB:
        print("YES")
    else:
        print("NO")

Solution (Python):
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
c='YES'
if A<B:
    A+=V*T
    B+=W*T
    if A<B:
        c='NO'
else:
    A-=V*T
    B-=W*T
    if A>B:
        c='NO'
print(c)

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
flg = 1
if a > b:
    flg = -1

a = a+v*t*flg
b = b+w*t*flg

if flg == 1:
    if a >= b:
        print('YES')
    else:
        print('NO')
else:
    if a <= b:
        print('YES')
    else:
        print('NO')

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if a == b:
  print("YES")
elif a < b:
  a_new = a + v * t
  b_new = b + w * t
  if a_new >= b_new:
    print("YES")
  else:
    print("NO")
else:
  a_new = a - v * t
  b_new = b - w * t
  if a_new <= b_new:
    print("YES")
  else:
    print("NO")

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if v <= w:
    print('NO')
    exit()

if a < b:
    d1 = a + v * t
    d2 = b + w * t
    if d1 < d2:
        print('NO')
        exit()
else:
    d1 = a - v * t
    d2 = b - w * t
    if d1 > d2:
        print('NO')
        exit()

print('YES')

Solution (Python):
a, v = map(int, raw_input().split())
b, w = map(int, raw_input().split())
t = int(raw_input())
if v > w and abs(a - b) <= abs(v - w) * t:
    print "YES"
else:
    print "NO"

Solution (Python):
def input_int():
    return map(int, input().split())

def one_int():
    return int(input())

def one_str():
    return input()

def many_int():
    return list(map(int, input().split()))

A, V = input_int()
B, W = input_int()

T = one_int()

speed = (V-W)

kyori = abs(B-A)

if speed*T >= kyori:
    print("YES")
else:
    print("NO")

Solution (Python):
from sys import exit
import math
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

a,v = mi()
b,w = mi()
t = ii()

dis = abs(a-b)

if v<=w:
    print("NO")
    exit()

if dis <= abs(v-w)*t:
    print("YES")
else:
    print("NO")

Solution (Python):
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())

if W>=V:
    print('NO')
else:
    if (V-W)*T>=abs(B-A):
        print('YES')
    else:
        print('NO')

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
distance = abs(a - b)
distance_t = (v * t) - (w * t)

if distance - distance_t <= 0:
    print('YES')
else:
    print('NO')

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if A < B:
  A_P = A + V * T
  B_P = B + W * T
  if A_P >= B_P:
    print("YES")
  else:
    print("NO")
else:
  A_P = A - V * T
  B_P = B - W * T
  if A_P <= B_P:
    print("YES")
  else:
    print("NO")

Solution (Python):
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())

if V <= W:
    print("NO")
elif abs((B-A))/(V-W) <= T:
    print("YES")
else:
    print("NO")

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if a < b:
    r1 = a + v * t
    r2 = b + w * t
    if r1 >= r2:
        print('YES')
    else:
        print('NO')
else:
    r1 = a - v * t
    r2 = b - w * t
    if r1 <= r2:
        print('YES')
    else:
        print('NO')

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if(W > V):
    print('NO')
else:
    distance = abs(B-A)
    velocity = V - W
    if(distance > velocity*T):
        print('NO')
    else:
        print('YES')

Solution (Python):
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())

kyori = abs(A-B)
if A == B:
    print("YES")
    exit()
if V > W:
    if kyori/(V-W) > T:
        print("NO")
    else:
        print("YES")
else:
    print("NO")

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

lag = False
if V < W:
    flag = False
else:
    if (V-W)*T >= abs(A-B):
        flag = True
    else:
        flag =False

if flag:
    print('YES')
else:
    print('NO')

Solution (Python):
A,V = input().split()
B,W = input().split()
T = input()
Q = 0
try:
  Times = abs(int(A)-int(B))/(int(V)-int(W))
except:
  Times = 0
  Q = 1
if int(V)<=int(W):
  print("NO")
  Q = 1
elif int(T) >= Times:
  print("YES")
else:
  print("NO")

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if abs(b-a) <= abs(v-w)*t:
    if v > w:
        print('YES')
    else:
        print('NO')
else:
    print('NO')

Solution (Python):
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if A <= B and A+T*V >= B+T*W:
  print("YES")
elif A >=B and A-T*V <= B-T*W:
  print("YES")
else:
  print("NO")

Solution (Python):
a, v  = map(int, input().split())
b,w  = map(int, input().split())
t = int(input())

if abs(a-b) <= t*(v-w):
    print('YES')
else:
    print('NO')

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if a < b:
    oni = a + t * v
    child = b + t * w
    if oni >= child:
        print('YES')
    else:
        print('NO')
elif a > b:
    oni = a - t * v
    child = b - t * w
    if oni <= child:
        print('YES')
    else:
        print('NO')
else:
    print('YES')

Solution (Python):
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())

kyori_sa = abs(a-b)
if v < w:
    print("NO")
elif v > w:
    if (v-w)*t >= kyori_sa:
        print("YES")
    else:
        print("NO")
elif v==w:
    if a == b:
        print("YES")
    else:
        print("NO")

Solution (Python):
A, V = (int(x) for x in input().split())
B, W = (int(x) for x in input().split())
T = int(input())

if A < B:
    if A + V * T >= B + W * T:
        print("YES")
    else:
        print("NO")
else:
    if A - V * T <= B - W * T:
        print("YES")
    else:
        print("NO")

Solution (Python):










import sys
sys.setrecursionlimit(1000000)

A,V = map(int,sys.stdin.readline().split())
B,W = map(int,sys.stdin.readline().split())
T = int(sys.stdin.readline().rstrip())

if A==B:
    print("YES")
    exit()
if W-V>=0:
    print("NO")
    exit()
if abs(A-B)/(V-W)<=T:
    
    print("YES")
    exit()
print("NO")

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

dis =  abs(b-a) - (v-w)*t

if dis > 0 :
  print('NO')
else :
  print('YES')

Solution (Python):
A,V=map(int,input().split())
B,W=map(int,input().split())
T=input()
if ((V-W)*int(T)) < abs(B-A):
    print('NO')
else:
    print('YES')

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())


if V == W:
    print("NO")
else:
    if abs(A - B) > T * (V - W):
        print("NO")
    else:
        print("YES")

Solution (Python):
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())

if w>=v:
    print("NO")
else:
    dif=v-w
    if dif*t>=abs(a-b):
        print("YES")
    else:
        print("NO")