peterverebics/CodeNet_Python_118 huggingface dataset:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

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

print('YES' if abs(b-a) <= (v-w) * t else 'NO')
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")
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

R = abs(A - B)
R2 = (V - W) * T

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

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

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

ans = abs(b-a) / (v-w)

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

if a > b:
    a,b = b,a
x = a+v*t
y = b+w*t
if x<y:
    print("NO")
else:
    print("YES")
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if v <= w:
    print("NO")
elif abs(a-b) / abs(v-w) <= t:
    print("YES")
else:
    print("NO")
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')
A,V=(int(x) for x in input().split())
B,W=(int(x) for x in input().split())
T=int(input())

kyori=abs(A-B)
sokudo=V-W
if kyori<=sokudo*T:
    print('YES')
else:
    print('NO')
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')
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")
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')
a,v=map(int,input().split())
b,w=map(int,input().split())
s=int(input())
if(abs(a-b)>(v-w)*s):
  print("NO")
else:
  print("YES")
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
C = abs(A - B)
if C + W * T <= V * T:
    print("YES")
else:
    print("NO")
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())

if v<w:
    print("NO")
elif v==w:
    if a==b:
        print("YES")
    else:
        print("NO")
elif v>w:
    t0 = abs((a-b)/(v-w))
    if t0<=t:
        print("YES")
    else:
        print("NO")
A, V = tuple(int(c) for c in input().split(' '))
B, W = tuple(int(c) for c in input().split(' '))
T = int(input())

delta = V - W

if A == B:
  print('YES')
  exit()
elif delta <= 0:
  print('NO')
  exit()
else:
  d = abs(A-B)
  time = d / delta
  if time <= T:
    print('YES')
  else:
    print('NO')
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

Kyori = abs(A-B)

if Kyori == 0:
	print('YES')
	exit()

if Kyori <= (V-W)*T:
	print('YES')
else:
	print('NO')
A,V = map(int,input().split())
B,W = map(int,input().split())
T=int(input())
if V<=W:
  print("NO")
elif abs(A-B)/abs(V-W)<=T:
  print("YES")
else:
  print("NO")
import sys
import copy
from collections import deque
stdin = sys.stdin

mod = 10**9+7

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

a, v = na()
b, w = na()
t = ni()

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

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

la, ra = a - t * v, a + t * v + 1
lb, rb = b - t * w, b + t * w + 1


l, r = min(la, lb), max(ra, rb)
if l == la and r == ra:
    print("YES")
else:
    print("NO")
A, V = map(int, input().split())
B,W = map(int, input().split())
T = int(input())

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


  
#print(a_ans,b_ans)
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if V == W:
    sec = T + 1
else:
    sec = abs(A - B) / (V - W)

if W >= V:
    print("NO")
else:
    if sec <= T:
        print("YES")
    else:
        print("NO")
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if a > b:
    a, b = b, a

oni = a + v * t
nige = b + w * t

if oni >= nige:
    print('YES')
else:
    print('NO')
a,v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())

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

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

print(ans)
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")
import sys
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if V <= W:
    print('NO')
    sys.exit()    

kyori = abs(A-B)
speed = abs(W-V)
ans = kyori / speed
if ans <= T:
    print("YES")
else:
    print("NO")
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")
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")
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')
A,V = map(int,input().split())
B,W = map(int, input().split())
T = int(input())
if A<B and V*T+A>=W*T+B:
    print('YES')
elif A>B and A-T*V<=B-T*W:
    print('YES')
else:
    print('NO')
A,V=list(map(int,input().split()))
B,W=list(map(int,input().split()))
T=int(input())
if A==B:
    print("YES")
    exit()
if A>B:
    h0 = -1*V * T + A
    h1 = -1*W * T + B
    if h0 <= h1:
        print("YES")
    else:
        print("NO")
else:
    h0 = V * T + A
    h1 = W * T + B
    if h0 >= h1:
        print("YES")
    else:
        print("NO")
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')
import sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()

def resolve():
    A, V = LI()
    B, W = LI()
    T = I()

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

    print(ans)

if __name__ == '__main__':
    resolve()
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')
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())

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

if a == b:
    print("NO")

As = v * t + a
Bs = w * t + b

if v > w:
    if abs(a - b)/abs(v - w) <= t:
        print("YES")
    else:
        print("NO")
else:
    print("NO")
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if a<b:
  if w<v:
    if (v-w)*t>=(b-a):
      print("YES")
    else:
      print("NO")
  else:
    print("NO")
else:
  if w<v:
    if (v-w)*t>=(a-b):
      print("YES")
    else:
      print("NO")
  else:
    print("NO")
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if w>=v:
    print("NO")
elif abs(a-b) <= t*(v-w):
    print("YES")
else:
    print("NO")
a, v = map (int, input().split())
b, w = map (int, input().split())
t = int(input())
if b > a:
    if  v <= w:
        print("NO")
    elif v > w:
        if a+v*t >= b + w*t:
            print("YES")
        else:
            print("NO")
else:
    if  v <= w:
        print("NO")
    elif v > w:
        if a+(-v)*t <= b + (-w)*t:
            print("YES")
        else:
            print("NO")
from math import *

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

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

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

dis=abs(a-b)
vel=v-w

if vel>0 and vel*t>=dis:
    print('YES')
else:
    print('NO')
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

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

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

# if b+1000000000+w*t > a+1000000000+v*t:
#     print("NO")
# else:
#     print("YES")


if a <b:
    dis = b - a
else:
    dis = a - b

dif = v-w

if w > v:
    print("NO")
elif dis <= dif*t:
    print("YES")
else:
    print("NO")
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    a, v = map(int, input().split())
    b, w = map(int, input().split())
    t = int(input())
    dist = abs(a - b)
    sokudo = v - w
    if sokudo <= 0:
        print("NO")
    else:
        T = dist / sokudo
        print("YES" if T <= t else "NO")


if __name__ == '__main__':
    resolve()
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
dis = abs(a - b)
sb = v - w
if sb <= 0:
    print("NO")
    exit()
time = dis / sb
if time > t:
    print("NO")
else:
    print("YES")
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")
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())

if W >= V:
  print("NO")
  exit()

dis = abs(A-B)
vel = abs(V-W)

c = vel*T

if dis <= c:
  print("YES")
else:
  print("NO")
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")
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if A < B:
  a = A + T * V
  b = B + T * W
  
else:
  b = A - T * V
  a = B - T * W
  
if b <= a:
  ans = 'YES'
else:
  ans = 'NO'
  
print(ans)
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
dist = abs(a-b)

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

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

speed = v-w

if dist <= speed*t:
	print("YES")
else:
	print("NO")
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:
        print("YES")
    else:
        print("NO")
else:
    if A - V * T <= B - W * T:
        print("YES")
    else:
        print("NO")
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')
import math
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if V!=W:
    if V>W and math.ceil(abs(B-A)/(V-W))<=T:
        print("YES")
        exit()
print("NO")
A, V = list(map(int, input().split()))
B, W = list(map(int, input().split()))
T = int(input())

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

if dist == 0: flag = "YES"
print(flag)
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):
    print("NO")
elif (D / S <= T):
    print("YES")
else:
    print("NO")
# N = int(input())
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")
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
ans = "NO"
if A < B:
  x = A + V * T
  y = B + W * T
  if x >= y:
    ans = "YES"
else:
  x = A - V * T
  y = B - W * T
  if x <= y:
    ans = "YES"
print(ans)
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")
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
d=abs(b-a)
s=v-w
if d<=s*t:
    print('YES')
else:
    print('NO')
import math
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if v>w and abs(a-b)/(v-w)<=t:
  print("YES")
else:
  print("NO")
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
l = abs(a - b)
u = v-w
# print(l)
# print(u*t)
if l > u * t:
    print('NO')
else:
    print('YES')
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
dist = abs(a-b)
speed = v-w
if speed<=0:
    print('NO')
    exit()
if dist<=speed*t:
    print('YES')
else:
    print('NO')
import sys

a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if (a == b):
    print('YES')
    sys.exit(0)
if (v <= w):
    print('NO')
    sys.exit(0)
res = abs(a - b) / (v - w)
if (res > t):
    print('NO')
else:
    print('YES')
sys.exit(0)
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
dif = abs(a-b)
if (v-w)*t >= dif:
    print("YES")
else:
    print("NO")
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")
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

kyori = abs(a-b)
sokudo = (v-w)

if sokudo > 0:
    if (kyori/sokudo)<=t:
        print("YES")
        exit()
elif sokudo == 0:
    if kyori == 0:
        print("YES")
        exit()

print("NO")
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')
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
if v-w>0 and abs(a-b)/(v-w)<=t:
    print("YES")
else:
    print("NO")
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
d = abs(a-b)
if w-v >= 0:
    print("NO")
else:
    if t*(v-w) >= d:
        print("YES")
    else:
        print("NO")
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
d = abs(A - B)
if d <= (V - W) * T:
  print("YES")
else:
  print("NO")
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")
A, V = map(int, input().split(' '))
B, W = map(int, input().split(' '))
T = int(input())

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

if V - W <= 0:
    print('NO')
    exit(0)

t = distance // speed
if distance % speed == 0:
    if t <= T:
        print('YES')
    else:
        print('NO')
else:
    if t + 1 <= T:
        print('YES')
    else:
        print('NO')
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:
        (a-b)//(v-w)+1<=t
        ans="Yes"
    else:
        (b-a)//(v-w)+1<=t
        ans="Yes"
a,v = input().split()
b,w = input().split()
t = input()

a_kyori = int(t) * int(v) + int(a)
b_kyori = int(t) * int(w) + int(b)

if a_kyori >= b_kyori:
    print("Yes")
else:
    print("No")
import sys
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if a>b or w>v:
    print('NO')
    sys.exit()
for tt in range(1,t):
    res = (w - v) * tt + (b - a)
    if res == 0:
        print('YES')
        sys.exit()

print('NO')
# -*- coding: utf-8 -*-

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

k = b - a
flag = False

if k >= 0:
    l = T*v - T*w 
    if (k <= l):
        flag = True

if k < 0:
    k = a - b
    l = T*w - T*v
    if (k <= l):
        flag = True


if (flag == True):
    print('YES')
else:
    print('NO')
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")
else:
    if -(-(b-a)//(v-w)) <= t:
        print("YES")
    else: print("NO")
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

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

a = abs(B-A)
v = V-W
v2 = v*T

if(a<=v2):
    print("Yes")
else:
    print("No")
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())

for i in range(1,T):
    if A + V * i == B + W * i:
        print("YES")
        exit()
print("NO")
a,b=map(int,input().split())
c,d=map(int,input().split())
e=int(input())
if a<0 and c<0:
  if a>c:
    print('NO')
  else:
    if  a+b*e>=c+d*e:
      print('YES')
  
    else:
      print('NO')
      
else:
  if  a+b*e>=c+d*e:
    print('YES')
  
  else:
    print('NO')
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if a < b:
  if w < v and (b-a)%(v-w)==0 and int((b-a)/(v-w)) <= t:
    print("YES")
  else:
    print("NO")
else:
  print("NO")
from sys import stdin
input = stdin.readline

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

if B > A:
    if (V - W) * T + A >= B:
        print("YES")
    else:
        print("NO")
else:
    if (V - W) * T + A <= B:
        print("YES")
    else:
        print("NO")
A,V = [int(v) for v in input().split()]
B,W = [int(v) for v in input().split()]
T = int(input())

A += int(1e9)
B += int(1e9)

if V * T + A >= W * T + B:
    print("YES")
else:
    print("NO")
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
if v>w:
  if b-a<=(v-w)*t:
    print('YES')
    exit()
print('NO')
AV = list(map(int,input().split()))
BW = list(map(int,input().split()))
T = int(input())

A = AV[0]
V = AV[1]
B = BW[0]
W = BW[1]

for i in range(T):
    if A <= B:
        B += W
        A += V
    else:
        B -= W
        A -= V

if abs(A) >= abs(B):
    print('Yes')
else:
    print('No')
a,v = list(map(int,input().split()))
b,w = list(map(int,input().split()))
t = int(input())

if (v - w > 0) and (a != b):
    if abs(a-b) <= (v - w) * t:
        print("Yes")
    else:
        print("No")
    
elif a == b:
    print("Yes")

else:
    print("No")
a,v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())

distance = b - a
speed_remainder = v - w

if distance <= 0:
    print("NO")
elif distance <= t * speed_remainder:
    print("YES")
else:
    print("NO")
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()
  
if A > B:
  V *= -1
  W *= -1
    
  for t in range(T):
    A += V
    B += W
    print(t,A,B)
    if A <= B:
      print("YES")
      exit()
  
else:
  for t in range(T):
    A += V
    B += W
    if A >= B:
      print("YES")
      exit()
    
print("NO")
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

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