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 and V <= W:
    print("NO")
elif max(A - B,B - A) / (V - 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())
if V <= W:
  print('NO')
elif abs(A-B) > abs(V-W) * T:
  print('NO')
else:
  print('YES')

Solution (Python):


import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def isp():   return input().split()
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, v = mi()
    b, w = mi()
    t = ii()

    if v <= w:
        print('NO')
    else:
        dist = abs(a - b)
        print('YES') if dist <= t * (v - w) 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 v <= w:
    print('NO')
else:
    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 or (abs(A-B)/(V-W))>T:
    print("NO")
else:
    print("YES")

Solution (Python):
a, v = [int(k) for k in input().split()]
b, w = [int(k) for k in input().split()]
t = int(input())
d = abs(a - b)
if d <= v * t - 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 > 0):
    if(abs(A-B)/(V-W) <= T):
        print("YES")
    else:
        print("NO")
else:
    print("NO")

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

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

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

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

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

Solution (Python):

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

dist = abs(a-b)
dist += (t*w)

if dist <= v*t:
    print('YES')
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())

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

Solution (Python):
import sys
import  math
import fractions
from collections import defaultdict
stdin = sys.stdin
     
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))


A,V=nm()
B,W=nm()
T=int(input())

d=abs(A-B)
move_s=(V-W)
if(move_s<=0):
    print("NO")
    sys.exit(0)
if(((d//move_s))<=(T-1) or ((d//move_s)==T and (d%move_s==0)) ):
    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:
    ans = "NO"
else:
    if abs(A - B) / (V - W) <= T:
        ans = "YES"
    else:
        ans = "NO"
print(ans)

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

Solution (Python):
a,u=map(int,input().split())
b,v=map(int,input().split())
t=int(input())
if(a==b):
  print('YES')
else:
  dif=abs(b-a)
  d=v*t
  dif+=d
  d1=u*t
  if(d1>=dif):
    print('YES')
  else:
    print('NO')

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


  if A<=B:
      after_A=A+V*T
      after_B=B+W*T
      if after_B<=after_A:
          print("YES")
      else:
          print("NO")
  else:
      after_A=A-V*T
      after_B=B-W*T
      if after_A<=after_B:
          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:
    print('YES' if b+w*t <= a+v*t else 'NO')
else:
    print('YES' if b-w*t >= a-v*t else '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 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 W>=V:
  print("NO")
else:
  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 <= 0:
    print('NO')
    exit()
ans=abs(a-b)/(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())
if not V > W:
  print("NO")
elif (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())

if A < B:
    A_res = A + V * T
    B_res = B + W * T

    if A_res >= B_res:
        print("YES")
    else:
        print("NO")

else:
    A_res = A - V * T
    B_res = B - W * T

    if A_res <= B_res:
        print("YES")
    else:
        print("NO")

Solution (Python):
info_A = input().split()
info_B = input().split()
T = int(input())
win = ''

A = int(info_A[0]) 
V = int(info_A[1]) 
B = int(info_B[0]) 
W = int(info_B[1]) 


if W >= V:
    win = 'B'

else:

    k = (B-A)/(V-W)
    if A>B:
        k = -k
    
    if k <= T and 0 < k:
        win = 'A'
    else:
        win = 'B'


if win == 'A':
    print('YES')
else:
    print('NO')

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

Solution (Python):

import sys
import numpy as np
input = sys.stdin.readline

a, b = map(int, input().split())
c, d = map(int, input().split())
t = int(input())
if b==d :
    print('NO')
elif (abs(a-c)/(b-d))<= t and d<b :
    print('YES')
else:
    print('NO')

Solution (Python):
A,V = map(int,input().split(" "))
B,W = map(int,input().split(" "))
T, = map(int,input().split(" "))
kyori = abs(A-B)
dif = V-W
if dif>0:
  if kyori/dif<=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())

d = abs(B-A)
e = V-W

if e*T>=d:
    print("YES")
else:
    print("NO")

Solution (Python):
import sys
rm = lambda: map(int, sys.stdin.buffer.readline().split())
ri = lambda: int(sys.stdin.readline())
a, v = rm()
b, w = rm()
t = ri()
if v - w == 0:
  print('NO')
  exit()
if 0 <= 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 a == b:
  print('YES')
elif a < b:
  if b + w * t <= a + v * 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())


ans="NO"
if a<b:
    a+=v*t;b+=w*t
    if a>=b:
        ans="YES"
else:
    a-=v*t;b-=w*t
    if a<=b:
        ans="YES"

print(ans)

Solution (Python):
buf = list(map(int, input().split()))
A=buf[0]
V=buf[1]
buf2 = list(map(int, input().split()))
B=buf2[0]
W=buf2[1]
T= int(input())

if A>B:
  if B-W*T<A-V*T:
    print("NO")
  else:
    print("YES")
else:
  if B+W*T>A+V*T:
    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 a <= b:
        if 0 <= (b-a)/(v-w) <= t:
            print('YES')
        else:
            print('NO')
    else:
        if 0 <= (b-a)/(w-v) <= t:
            print('YES')
        else:
            print('NO')

Solution (Python):
from collections import defaultdict as dd
from collections import deque
import bisect
import heapq

def ri():
    return int(input())

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


def solve():
    a, v = rl()
    b, w = rl()
    t = ri()
    d = abs(a - b)
    s = v - w
    if t * s >= d:
        print ("YES")
    else:
        print ("NO")





mode = 's'

if mode == 'T':
    t = ri()
    for i in range(t):
        solve()
else:
    solve()

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

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

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

if w >= v:
    print("NO")
else:
    if u * 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(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 (v-w)*t >= abs(b-a):
    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 V <= W:
    print('NO')
    sys.exit()

d = abs(A-B)
v = V - W
if 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())

if v*t >= abs(b-a) + 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:
    difAB = abs(A-B)
    difVW = V-W
    if difAB<=difVW*T:
        print("YES")
    else:
        print("NO")

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

Solution (Python):




import sys

iimr = lambda: map(int, sys.stdin.readline().rstrip().split())



def 関数(a, v, b, w, t):
    
    d = abs(a - b)
    if v <= w:
        return "NO"
    s = v-w
    if d <= s*t:
        return "YES"
    else:
        return "NO" 

def çözmek():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())

    res = []
    res.append(関数(A, V, B, W, T))
    print(*res, sep="\n")

if __name__ == "__main__":
    çözmek()

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 (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())

if a == b:
    print("YES")
    exit()

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


if a < b:
    if (b - a) <= t * (v - w): 
        print("YES")
    else:
        print("NO")
elif a > b:
    if (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())
l=abs(a-b)
if l==0:
    print('YES')
else:
    if w>=v:
        print('NO')
    else:
        if l<=t*(v-w):
            print('YES')
        else:
            print('NO')

Solution (Python):
A_V = input().split(" ")
B_W = input().split(" ")
T = int(input())
A = int(A_V[0])
V = int(A_V[1])
B = int(B_W[0])
W = int(B_W[1])
dA = A + V * T
dB = B + W * T
ndA = A - V * T
ndB = B - W * T
if (A<B):
    if (dA < dB):
        print("NO")
    else:
        print("YES")
else:
    if (ndA > ndB):
        print("NO")
    else:
        print("YES")

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

if a < b:
    print('YES' if v*t+a >= w*t+b else 'NO')
else:
    print('YES' if -v*t+a <= -w*t+b else '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")
  exit()
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())
d=abs(a-b)
u = v-w
if d-u*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 abs(b-a) <= (v-w)*T:
    print('YES')
else:
    print('NO')

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

speed = V-W
if speed<=0:
  ans = 'NO'
else:
  distance = abs(A-B)
  if distance <= speed*T:
    ans = 'YES'
  else:
    ans = 'NO'

print(ans)

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

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

if d-u*t<=0:
    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)

V=v-w
if V<=0:
    print("NO")
    exit()
T=d/V
if T<=t:
    print("YES")
else:
    print("NO")

Solution (Python):
import sys
input = sys.stdin.readline

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

Solution (Python):
import numpy as np

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

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

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

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

main()

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

dis = abs(a-b)
a_move = n*v
b_move = n*m

if dis+b_move - a_move <= 0:
    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())
s = 'YES'
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())

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

if dist > kasoku * t:
  print('NO')
else:
  print('YES')

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

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

if r_vel * t >= dist:
    print("YES")
else:
    print("NO")

Solution (Python):
p1 , s1=map(int , input().split()) 
p2 , s2=map(int , input().split())
t=int(input()) 
if abs(p1-p2) > t*(s1-s2):
  print("NO")
else:
  print("YES")

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

t = int(input())

if a == b:
    print('YES')
    exit()

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

d = abs(a - b)

vel = v - w

if (d + vel - 1) // vel > t:
    print('NO')
else:
    print('YES')

Solution (Python):
A,V = map(int,input().split())
B,W = map(int,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):
A,V = map(int,input().split())
B,W = map(int,input().split())

T = int(input())

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

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

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

if abs(a-b)+w*t <= v*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) <= t * (v-w):
  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")
    exit()

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

if fast * t >= dist:
    print("YES")
else:
    print("NO")

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

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

Solution (Python):

l=list(map(int, input().split(' ')))
a=l[0]
v=l[1]
l=list(map(int, input().split(' ')))
b=l[0]
w=l[1]
s=int(input())
ans=True
if a>b:
    ans=a-v*s<=b-w*s
else:
    ans=a+v*s>=b+w*s
if ans:
    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 (v-w)*t >= abs(a-b):
        print("YES")
    else:
        print("NO")

Solution (Python):
import sys
readline = sys.stdin.readline

def main():
    A, V = map(int, readline().rstrip().split())
    B, W = map(int, readline().rstrip().split())
    T = int(readline())

    v = V - W
    if v <= 0:
        print('NO')
        return
    
    if abs(A - B) / v > T:
        print('NO')
    else:
        print('YES')

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 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 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")
    exit(0)
s=abs(b-a)/(v-w)
if 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 a <= b:
    total_a = a + v * t
    total_b = b + w * t
    if total_a >= total_b:
        print('YES')
    else:
        print('NO')
else:
    total_a = a - v * t
    total_b = b - w * t
    if total_a <= total_b:
        print('YES')
    else:
        print('NO')

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

print("YES" if s<=0 and k+t*s<=0 else "NO")

Solution (Python):
import numpy as np
a, v = list(map(int, input().split(' ')))
b, w = list(map(int, input().split(' ')))
t = int(input())

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

catchup_speed = (v - w)
start_dis = np.abs(b - a)

max_dis = t*catchup_speed

if start_dis <= max_dis:
    print('YES')
    exit()

print('NO')

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

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if abs(a-b)+w*t <= v*t:
    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 W >= V:
    print('NO')
elif 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())
d = t * (v - w)
if abs(a-b) <= d:
  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()
else:
    that = abs(b-a)/(v-w)
    if 0 <= that <= t:
        print('YES')
    else:
        print('NO')

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
d = V-W
if d <= 0:
    print("NO")
else:
    if abs(A-B) <= (d*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")
  exit()

if abs(a-b)/abs(v-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())

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

Solution (Python):

def s0():return input()
def s1():return input().split()
def s2(n):return [input() for x in range(n)]
def s3(n):return [input().split() for _ in range(n)]
def s4(n):return [[x for x in s] for s in s2(n)]
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
def t3(n):return [tuple(int(x) for x in input().split()) for _ in range(n)]
def p0(b,yes="Yes",no="No"): print(yes if b else no)








a,v=n1()
b,w=n1()
t=n0()

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

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

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

    d = abs(A - B)
    s = V - W
    print('YES' if T * s >= d else '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:
  print('YES')
else:
  if v <= w:
  	print('NO')
  else:
    if abs(a-b) / (v - w) <= t:
      print('YES')
    else:
      print('NO')

Solution (Python):
a_index, a_v = map(int, input().split())
b_index, b_v = map(int, input().split())
t = int(input())
 
d = abs(b_index - a_index)
d_v = a_v - b_v
 
if d == 0 :
  print("YES")
elif d_v > 0 and d / d_v <= t :
  print("YES")
else :
  print("NO")

Solution (Python):



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

    if w >= v:
        print("NO")
    elif abs(b-a)/(v-w) <= t:
        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 v <= w:
    print("NO")
    exit()

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

if d <= t*s:
    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 (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 v <= w:
    print('NO')
else:
    if 1 <= (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 v <= w and a != b:
  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())
diff_dist = B - A
diff_v = V - W
flag = False
if diff_v == 0:
    if diff_dist == 0:
        flag = True
elif diff_dist == 0:
    flag = True
else:
    if diff_v > 0:
        t = abs(diff_dist) / diff_v
        if t <= T:
            flag = True
if flag:
    print('YES')
else:
    print('NO')

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

D = abs(A - B)
X = V - W

if (X*T >= D):
  print("YES")
else:
  print("NO")

Solution (Python):

a, v = map(int, input().split())


b, w = map(int, input().split())


t = int(input())


sa_x = abs(b-a)
sa_v = v-w


if (sa_v * t >= sa_x):
  print('YES')
else:
  print('NO')

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

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


if V<=W:
    print('NO')
else:
    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())

judge = (V-W)*T >= abs(A-B)
if(judge):
  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:
    x=a-v*t
    y=b-w*t
    if x<=y:
        print('YES')
    else:
        print('NO')
else:
    x=a+v*t
    y=b+w*t
    if x>=y:
        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:
    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:
    oni = a + (-1*v) * t
    nige = b + (-1*w) * t
    if oni <= nige:
        print("YES")
    else:
        print("NO")
else:
    oni = a + v*t
    nige = b + w * t
    if oni >= nige:
        print("YES")
    else:
        print("NO")

Solution (Python):

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

    diff_d = abs(A - B)
    dif_move = (V - W) * T

    if diff_d <= dif_move:
        print("YES")
    else:
        print("NO")

if __name__ == "__main__":
    resolve()

Solution (Python):
a, v = [int(x) for x in input().split()]
b, w = [int(x) for x in input().split()]
t = int(input())
if w > v:
    print("NO")
elif w == v:
    if a == b:
        print("YES")
    else:
        print("NO")
else:
    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())
f = (v-w)*t
c = a-b
if(c<0):
  c *= (-1)
if(c>f):
  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:
    L=abs(A-B)
    if L/(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)*T >=abs(B-A):
    print("YES")
else:
    print("NO")

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce, lru_cache  
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**6)


a, v = (int(x) for x in input().split())
b, w = (int(x) for x in input().split())
t = int(input())

if a == b:
    print("YES")
elif a < b:
    if a + t*v >= b + t*w:
        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())

AB = abs(A - B)
VW = V - W

if VW == 0:
  print("NO")
  
elif AB <= VW * 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(a-b)
q=v-w
if q<=0:
    print("NO")
else:
    x=q*t
    if x>=d:
        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:
    rel_vel = v - w
    dis = abs(a - b)
    time = dis / rel_vel
    if time <= 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 (abs(a-b) - (v-w)*t <= 0):
    print("YES")
    
else:print("NO")

Solution (Python):

a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
a, b = min(a, b), max(a, b)
print(["NO", "YES"][a + t * v >= b + t * w])

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())

d=abs(a-b)


if(v*t>=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(b-a) - (v-w)*t <= 0:
    print("YES")
else:
    print("NO")