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):
AV = input().split()
BW = input().split()
T = input().split()
A = int(AV[0])
V = int(AV[1])
B = int(BW[0])
W = int(BW[1])
T = int(T[0])
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 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())

ret1 = V * T
ret2 = abs(A-B) + W * T

if ret1 >= ret2 > 0:
  print('YES')
else:
  print('NO')

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

dis = b - a
mov = v - w

if mov * t >= abs(dis) and mov > 0:
    print('YES')
else:
    print('NO')

Solution (Python):
chaser_init, chaser_move = map(int, input().split())
target_init, target_move = map(int, input().split())
time = int(input())


if chaser_init < target_init:
    if chaser_move < target_move:
        answer = 'NO'
        
    else:
        if chaser_init + time*chaser_move >= target_init + time * target_move:
            answer = 'YES'
            
        else:
            answer = 'NO'
            

else:
    if chaser_move < target_move:
        answer = 'NO'
        
    else:
        if chaser_init - time*chaser_move <= target_init - time * target_move:
            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 A<B:
  A = A + V*T
  B = B + W*T
  if A>=B:
    print('YES')
  else:
    print('NO')
    
elif B<A:
  A = A - V*T
  B = B - W*T
  if A<=B:
    print('YES')
  else:
    print('NO')

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

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

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

Solution (Python):
A,Av= map(int, input().split())
B,Bv= map(int,input().split())
T = int(input())

if abs(B-A)>(Av-Bv)*T :
  print("NO")
else:
  print("YES")

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

ds = v - w

if ds <= 0: 
    print("NO")
else:
    dd = abs(a-b)

    dt = float(dd)/float(ds)

    if dt <= t:
        print("YES")
    else:
        print("NO")

Solution (Python):
oni,oniv = map(int, input().split())
ko,kov = map(int, input().split())
t = int(input())

if kov >= oniv:
    ans = "NO"
else:
    if oni > ko:
        oniAfter = oni - oniv*t
        koAfter = ko - kov*t
        if oniAfter <= koAfter:
            ans = "YES"
        else:
            ans = "NO"
    else:
        oniAfter = oni + oniv*t
        koAfter = ko + kov*t
        if oniAfter >= koAfter:
            ans = "YES"
        else:
            ans = "NO"

print(ans)

Solution (Python):

a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))
dist = abs(b[0] - a[0])
speed = a[1] - b[1]
if speed * c[0] >= dist:
  print("YES")
else:
  print("NO")

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

kyori = abs(A - B)

if kyori + 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 V <= W:
    print("NO")
elif (V - W) * 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 A == B:
    print('YES')
    sys.exit()

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

Solution (Python):
A = list(map(int, input().split()))
B = list(map(int, input().split()))
S = int(input())
if abs(A[0]-B[0]) <= ((A[1]-B[1]) * S):
    print("YES")
else:
    print("NO")

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

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

Solution (Python):
import sys, io, os, re
import bisect
from pprint import pprint
from math import sin, cos, pi, radians, sqrt, floor
from copy import copy, deepcopy
from collections import deque
from fractions import gcd
from functools import reduce
from itertools import groupby

n1 = lambda: int(sys.stdin.readline().strip())
nn = lambda: list(map(int, sys.stdin.readline().strip().split()))
f1 = lambda: float(sys.stdin.readline().strip())
fn = lambda: list(map(float, sys.stdin.readline().strip().split()))
s1 = lambda: sys.stdin.readline().strip()
sn = lambda: list(sys.stdin.readline().strip().split())
nl = lambda n: [n1() for _ in range(n)]
fl = lambda n: [f1() for _ in range(n)]
sl = lambda n: [s1() for _ in range(n)]
nm = lambda n: [nn() for _ in range(n)]
fm = lambda n: [fn() for _ in range(n)]
sm = lambda n: [sn() for _ in range(n)]

def array1(n): return [0] * n
def array2(n, m): return [[0] * m for x in range(n)]
def array3(n, m, l): return [[[0] * l for y in xrange(m)] for x in xrange(n)]

A, V = nn()
B, W = nn()
T = n1()

if V <= W:
    print("NO")
else:
    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 W >= V:
    print("NO")
else:
    diff = abs(A-B)
    if V*T - W*T  >= diff:
        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 and A + T* V >=B+ T* W:
    ans = "YES"
elif B < A and A -T* V <=B- T* W:
    ans = "YES"
else:
    ans ="NO"
print(ans)

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

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

Solution (Python):
a, v = [int(e) for e in input().split()]
b, w = [int(e) for e in input().split()]
t = int(input())

if abs(a-b) > (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())
flag = 0

if (V - W) <= 0:
    flag = 0
else:
    if ((V - W) * T) >= abs(A - B):
        flag = 1

if flag == 1:
    print("YES")
else:
    print("NO")

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

Solution (Python):
def B():
    a,v = list(map(int, input().split()))
    b,w = list(map(int, input().split()))
    t = int(input())
    if a < b and v*t+a < w*t+b:
        print("NO")
    elif b < a and v*t*(-1)+a > w*t*(-1)+b:
        print("NO")
    else:
        print("YES")
B()

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

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

b = abs(b - a)
a = 0

if (b + w * t) <= (0 + 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())

C=abs(B-A)
if C<=(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 != 0:
    X = abs(B-A)/(V-W)
    if X > T or X <= 0:
        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())

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

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

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

place_A=A+(T*V)
place_B=B+(T*W)

place_A_1=A-(T*V)
place_B_1=B-(T*W)

if A<B:
    if place_A>=place_B:
        print("YES")

    else:
        print("NO")

else:
    if place_A_1<=place_B_1:
        print("YES")
    else:
        print("NO")

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
print(['NO', 'YES'][a == b or ((v-w) > 0 and abs(b-a)/(v-w) <= t)])

Solution (Python):
a=list(map(int,input().split()))
b=list(map(int,input().split()))
t=int(input())
sa=a[1]-b[1]
d=abs(a[0]-b[0])
if sa<=0:
    print('NO')
elif sa*t<d:
    print('NO')
else:
    print('YES')

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

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

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

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

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


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

Solution (Python):
a, va = map(int, input().split())
b, wb = map(int, input().split())
t = int(input())

kyori = abs(b-a)
hayasa = wb-va

if hayasa >= 0:
  print('NO')
elif kyori / abs(hayasa) <= t:
  print('YES')
else:
  print('NO')

Solution (Python):

import sys
def p(*_a):
  
  _s=" ".join(map(str,_a))
  
  sys.stderr.write(_s+"\n")

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

ans = "NO"

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

p(x,y)
if y <= x*t:
  ans = "YES"

print(ans)

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

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

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

t = d/v

if T >= t:
    print("YES")
else:
    print("NO")

Solution (Python):
oni = list(map(int, input().split()))
nige = list(map(int, input().split()))
time = int(input())

if nige[1]>=oni[1]:
    print("NO")
else:
    distance = abs(oni[0]-nige[0])
    diff = oni[1]-nige[1]
    need_time = distance / diff
    if need_time > time:
        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 and a != b:
    print("NO")
    exit(0)

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

if r_v == 0:
    print("NO")
    exit(0)

if (s / r_v <= 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)
dv=v-w
if d<=t*dv:
  print('YES')
else:
  print('NO')

Solution (Python):
A, V = map(int,input().split())
B, W = map(int,input().split())
T = int(input())
sa = W-V
if sa == 0:
    if A != B:
        print('NO')
    else:
        print('YES')
    exit()
if W>V:
    print('NO')
    exit()
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 B > A:
    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 = [list(map(int, input().split())) for i in range(2)]
s = int(input())
if (a[0][1] <= a[1][1]):
    print("NO")
    exit()
if abs(a[1][0] - a[0][0]) /abs(a[0][1] - a[1][1]) <= s:
    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 (D + 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())
r = abs(a - b)

if (w - v) * t + r > 0:
  print("NO")
else:
  print("YES")

Solution (Python):
import math

a=input().split()
b=input().split()
T=int(input())

A=int(a[0])
V=int(a[1])
B=int(b[0])
W=int(b[1])


begin_dis=abs(B-A)


if((V-W)*T>=begin_dis):
  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:

    dist_a = a + t*v

    dist_b = b + t*w

    if dist_a>=dist_b:
        print('YES')
    else:
        print('NO')
else:

    dist_a = a - t*v

    dist_b = b - t*w

    if dist_a<=dist_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())

if v - w > 0 and 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 W >= V:
    print('NO')
else:
    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())
if v <= w:
  print("NO")
  exit()
print("YNEOS"[abs(a-b)/(v-w) > t::2])

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

    if T>=time:
        print("YES")
    else:
        print("NO")

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

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

ab = abs(a - b)
vw = v - w
if 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())

l = abs(A - B)
v = V - W
if v <= 0:
    print("NO")

elif v * T >= l:
    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:
    if A+T*V>= B+T*W:
        print('YES')
    else:
        print('NO')
if A>B:
    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())

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

if V <= W:
    print('NO')
else:
    X = S*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(V <= W ):
    print("NO") 
    exit()

t = V - W
if(abs(B-A) / t <= 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 (w>v) :
    print('NO')
    exit()

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

Solution (Python):
a = list(map(int,input().split()))
b = list(map(int,input().split()))
T = int(input())

lon = abs(a[0]-b[0])
if a[1]*T - b[1]*T >= lon :
    print("YES")
else :
    print("NO")

Solution (Python):


def main():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T =int(input())
    AB = abs(A-B)
    if V < W:
        ans='NO'
    elif AB <= (V-W)*T:
        ans='YES'
    else:
        ans='NO'
    print(ans)
    
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")
elif b<a:
    if b-t*w<a-t*v:
        print("NO")
    else:
        print("YES")
else:
    if a+t*v<b+t*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()
x=abs(a-b)
n=x//(v-w)
if  (v-w)*t>=x:
    print("YES")
else:
    print("NO")

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

resolve()

Solution (Python):
a, v = input().split(" ")
a = int(a)
v = int(v)

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

t = int(input())

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

Solution (Python):
import math
import itertools
import collections
import bisect
import heapq

def IN(): return int(input())
def sIN(): return input()
def MAP(): return map(int,input().split())
def LMAP(): return list(map(int,input().split()))
def TATE(n): return [input() for i in range(n)]
MOD = 10**9 + 7

a,v = MAP()
b,w = MAP()
t = IN()

if b > a:
  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)<=0:
    print ("NO")
    exit(0)
if A > B:
    if (A-B) / (V-W) <= T:
        print("YES")
    else:
        print("NO")
else: 
    if (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())

x_diff = abs(B - A)
v_diff = V - W

if v_diff > 0:
    if x_diff/v_diff <= T:
        print('YES')
    else:
        print('NO')
else:
    if x_diff == 0:
        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)
a = V*T
b = W*T



if a >= k + 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())


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

Solution (Python):
a, av = map(int, input().split())
b, bv = map(int, input().split())
t = int(input())

diff = abs(a-b)
vel = av - bv

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

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

main()

Solution (Python):

a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
ds = w - v
dd = abs(b - a)

if ds >= 0:
    print('NO')
    exit()
else:
    ans = dd / ds
    if -(ans) <= t:
        print('YES')
        exit()

print('NO')

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

kyori = (v-w) * t
aida = abs(a - b)

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

if kyori < 0:
    print("NO")
    exit()

if aida <= kyori:
    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')
else:  
  if b<a:
    if (a-b)/(v-w)<=t:
      print('YES')
    else:
      print('NO')
  else:
    if (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())
c = abs(b-a)
x = v-w
if x <= 0 :
  print('NO')
elif c/x <= t:
  print('YES')
else:
  print('NO')

Solution (Python):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline

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

d = abs(b - a)

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

Solution (Python):
a, v = [float(x) for x in input().split()]
b, w = [float(x) for x in input().split()]
t = int(input())
ret = v>w and abs(b-a)/(v-w)<=t
print('YES' if ret else 'NO')

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

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

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

Solution (Python):
from sys import stdin

a, v = [int(x) for x in stdin.readline().rstrip().split()]
b, w = [int(x) for x in stdin.readline().rstrip().split()]
t = int(input())


if a == b:
    print('YES')
elif a > b:
    dis = a-b
    if v*t - w*t >= dis:
        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())
d = abs(a - b)

if v * t < d + w * t:
    print("NO")
else:
    print("YES")

Solution (Python):
oni_x, oni_speed = map(int, input().split())
chi_x, chi_speed = map(int, input().split())
time = int(input())
ans = False


if oni_speed > chi_speed:
    sa = abs(oni_x - chi_x)
    sa_speed = oni_speed - chi_speed
    if sa_speed*time >= sa:
        ans = True

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

C = T * (V-W)

if L > C:
    print('NO')
else:
    print('YES')

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


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

Solution (Python):

A, V = [int(i) for i in input().split()]
B, W = [int(i) for i in input().split()]
T = int(input())
if A < B:
    if A + V * T >= B + W * T:
        print("YES")
    else:
        print("NO")
elif A > B:
    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())
d = abs(a-b)

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

Solution (Python):
import sys
input = sys.stdin.readline
def main():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())
    if A <= B:
        r = (B+ W*T) - (A + V*T)
        if r <= 0:
            print("YES")
        else:
            print("NO")
    else:
        r =   (B- W*T)-(A - V*T)
        if r >= 0:
            print("YES")
        else:
            print("NO")

if __name__ == '__main__':
    main()