peterverebics/CodeNet_Python_118 huggingface dataset:
A, V= (int(x) for x in input().split())
B, W = (int(x) for x in input().split())
T = int(input())
 
for i in range(1,T+1):
    if (A < B and V <= W) or (A > B and V >= W):
        print("NO")
        break;
    else:
        print("YES")
        break;
import sys

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

ai = []
bi = []

for i in range(t):
    av = a + v * (i+1)
    bw = b + w * (i+1)
    ai.append(av)
    bi.append(bw)

for i in range(t):
    if ai[i] == bi[i]:
        print('YES')
        sys.exit()
print('NO')
A,V = map(int, input().split())
B,W = map(int, input().split())
T = int(input())
P = "NO"

if V > W: 
    while B >= A and T >= 0:
        if A == B:
            P = "YES"
            break
        A = A + V
        B = B + W
        T = T - 1
    
print(P)
A,X=map(int,input().split())
B,Y=map(int,input().split())
T=int(input())
c=[]

for i in range(1,T+1):
  a=A+X*i
  b=B+Y*i
  if a==b:
    c.append(a)
if len(c)==1:
  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")
a,v = map(int,input().split())
b, w= map(int,input().split())
t = int(input())
A = a+(t*v)
B = b + (t*w)
if B <= A:
    print('YES')
else:
    print('NO')
# coding: utf-8
# Your code here!
def LI():return list(map(int,input().split()))
def yes():print("YES")
def no():print("NO")

a,v=LI()
b,w=LI()
t=int(input())

akun=a+v*t
bkun=b+w*t

if a<b:
    if akun>=bkun:
        yes()
    else:
        no()
else:
    if akun<=bkun:
        yes()
    else:
        no()
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if V-W == 0:
  print('NO')  
elif V-W < 0:
  print('NO')
elif B-A < 0:
  print('NO')
elif (B-A)/(V-W) <= T:
  print('YES')
else:
  print('NO')
ax, at = map(int, input().split(' '))
bx, bt = map(int, input().split(' '))
t = int(input())

if ax > bx:
	ax, at, bx, bt = bx, bt, ax, at

a_l = ax + at*t
b_l = bx + bt*t

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

def main():
  inputs = [input() for i in range(3)]
  oni = list(map(int, inputs[0].split()))
  kid = list(map(int, inputs[1].split()))
  time = int(inputs[2])
  
  pA = oni[0]
  pB = kid[0]
  for i in range(time):
    print(pA, pB)
    if pA == pB:
      print("YES")
      return 0
    pA = pA + oni[1]
    pB = pB + kid[1]
  print("NO")

if  __name__ == "__main__":
  main()
A, V = map(int, input().split()) 
B, W= map(int, input().split()) 
T = int(input())


diff1 = (A - B)
diff2 = (V - W)*T

if ( diff1 < diff2):
  print("YES")
else:
  print("NO")
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
flag = False
for i in range(1,T+1):
  if A+V*i == B+W*i:
    flag = True
    break
if flag == True:
  print("YES")
else:
  print("NO")
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

position_diff = b-a
pace_diff = v-w

if pace_diff < 0:
    print('NO')
elif pace_diff * t > position_diff:
    print('YES')
else:
    print('NO')
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())

tiji = abs(W-V)
kyori = abs(A-B)

if W>=V and A!=B:
    print('NO')
elif A==B:
    print('YES')
elif T*tiji < kyori:
    print('NO')
elif kyori % tiji ==0:
    print('YES')
else:
    print('NO')
A = list(map(int,input().split()))
B = list(map(int,input().split()))
T = int(input())
A[1] += (A[1] * T)
B[1] += (B[1] * T)

if A[1] > B[1]:
  print('YES')
else:
  print('NO')
import sys

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

d1 = v <= w
d2 = abs(a-b) <= t*(v-w)
if d1 <= d2 :
    print("Yes")
else:
    print('No')
ax, at = map(int, input().split(' '))
bx, bt = map(int, input().split(' '))
t = int(input())
 
a_l = ax + at*t
b_l = bx + bt*t
 
if a_l < b_l and at == bt:
	print("NO")
else:
	print("YES")
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
flg = True

if v <= w:
  flg = False
else:
  if a < b:
    if (b - a) / (v - w) == int((b - a) / (v - w)) and (b - a) / (v - w) <= t:
      flg = True
    else:
      flg = False
  else:
    if (a - b) / (v - w) == int((a - b) / (v - w)) and (a - b) / (v - w) <= t:
      flg = True
    else:
      flg = False
print("YES" if flg else "NO")
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())

av = a + (v*t)
bw = b + (w*t)

if av >= bw:
  print('YES')
else:
  print('NO')
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
L=abs(B-A)
vd=V-W
if L <= vd*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(0)

if v == w or a == b:
    print("NO")
    exit(0)

if a < b:
    t = (b-a) / (v-w)
    print("YES" if ((b-a) % (v-w) == 0) and (t <= T) else "NO")
else:
    t = (a-b) / (v-w)
    print("YES" if ((a-b) % (v-w) == 0) and (t <= T) else "NO")
a,v=(int(x) for x in input().split())
b,w=(int(x) for x in input().split())
t = int(input())

flag = 0
if v > w and a<=b:
    for i in range(t):
        if a+v*i == b+w*i:
            flag = 1
            break

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

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

oni_ichi = int(oni[0])
oni_move = int(oni[1])

kodomo_ichi = int(kodomo[0])
kodomo_move = int(kodomo[1])

move_dir_num = oni_ichi - kodomo_ichi

if move_dir_num >= 0:
  res = (kodomo_ichi - kodomo_move * limit_time) - (oni_ichi - oni_move * limit_time)
else:
  res = (kodomo_ichi + kodomo_move * limit_time) + (oni_ichi + oni_move * limit_time)
  
if res < 0:
  print("YES")
else:
  print("NO")
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if B==A:
  print("YES")
elif W >= V or B<A or 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+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 = V*T+A-1
b = W*T+B-1

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

at = v*t + a
bt = w*t + b

print(at, bt)

if at >= bt:
    print('YES')
elif at < bt:
    print('NO')
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())

for i in range(1,t):
    a += v
    b += w
    if a == b:
        print("YES")
        break
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=list(map(int,input().split()))
b,w=list(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')
elif a>b:
    if b-w*t>a-v*t:
        print('YES')
    else:
        print('NO')
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
print('YNEOS'[a+v*t < b+w*t::2])
a,b=map(int,input().split())
c,d=map(int,input().split())
e=int(input())
if  abs(a)+b*e>=abs(c)+d*e :
  print('YES')  
else:
  print('NO')
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"); exit()

u = d // s
print("YES" if u <= t else "NO")
a,v=map(int,input().split())#鬼
b,w=map(int,input().split())
t=int(input())

for i in range(t):
    if b<a:
        a-=v
        b-=w
    else:
        a+=v
        b+=w
    if a==b:
        print("Yes")
        exit()
print("No")
point_a, speed_a = map(int, input().split())
point_b, speed_b = map(int, input().split())
time = int(input())

list_a = [point_a]
list_b = [point_b]
for i in range(time):
  list_a.append(list_a[i] + speed_a)
  list_b.append(list_b[i] + speed_b)
  
for i in range(len(list_a)):
  if list_a[i] == list_b[i]:
    print("YES")
    break
else:
  print("NO")
A,V = list(map(int,input().split()))
B,W = list(map(int,input().split()))
T   = int(input())

distance = abs(A-B)
shorten  = abs(V-W)
flag = 0

if(V <= W):
  print("NO")
elif(distance < shorten):
  print("NO")
else:
    if(distance%shorten == 0):
      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())

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

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

catchup_speed = v - w
start_dis = b - a

if start_dis <= t*catchup_speed:
    print('YES')
    exit()

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

dis = B-A
mob = W-V

if A == B:
    print("Yes")

else:
    if mob >= 0:
        print("No")
    else:
        if dis % mob != 0:
            print("No")
        else:
            if dis + (mob*T) <= 0:
                print("Yes")
            else:
                print("No")
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
flag = False
for t in range(T+1):
    if A+V*t == B+W*t:
        flag = True
        break
if flag:
    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(A-B)%(V-W) == 0 and abs(A-B)/(V-W) <= T:
    print("YES")
  else:
    print("NO")
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
a, v = M()
b, w = M()
t = I()
a_now = a
b_now = b
ans = 'NO'
for i in range(t):
    a_now += v
    b_now += w
    if a_now == b_now:
        ans = 'YES'
print(ans)
A, V = list(map(int, input().split()))
B, W = list(map(int, input().split()))
T = int(input())

if V > W and T > (abs(A - B) / abs(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 > 0):
    if((A-B)//(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 (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==b:
  print('YES')
  exit()
  
if v>w:
  if b-a<=(v-w)*t:
    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')
else:
  if (v-w)*t >= abs(a-b):
    print('Yes')
  else:
    print('No')
import sys

la = list(map(int, input().split()))
lb = list(map(int, input().split()))
t = int(input())


nowDis = abs(lb[0] - la[0])
aDis = la[1]*t
bDis = lb[1]*t
speed = bDis - aDis

if lb[1] == 0:
    print("YES")
    sys.exit()

if speed >= 0:
    print("NO")
else:
    if nowDis / speed >= t:
        print("NO")
    else:
        print("YES")
# A V
# B W
# T
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if A < B and (V-W)*T >= B-A and (B-A) % (V-W) == 0:
    print('YES')
else:
    print('NO')
def main():
    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:
        return('YES')
    else:
        for i in range(T):
            A += V
            B += W
            if A >= B:
                return('YES')
        return('NO')
print(main())
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 >= max(A,B) - min(A,B) and (max(A,B) - min(A,B))%(V-W) == 0:
        print('YES')
    else:
        print('NO')
#!/usr/bin/env python

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

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

sub = B - A
speed = V - W
if sub >= T*speed:
  print("No")
else:
  print("YES")
A = list(map(int, input().split()))
B = list(map(int, input().split()))
T = int(input())
x=A[0]-B[0]
v=A[1]-B[1]

if v<=0:
    print('NO')
elif abs(x<T*v):
    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())
for i in range(1,T+1):
    d = abs(B-A)-(abs(V-W)*i)
    if d == 0:
        print("YES")
        break;
    elif d != 0 and i == T:
        print("NO")
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if v > w:
    if abs(a-b)//(v-w) <= t:
        print("YES")
    else:
        print("No")
else:
    print("NO")
A, V = [int(n) for n in input().split()]
B, W = [int(n) for n in input().split()]
T = int(input())

for t in range(1, T+1):
    if B+W*t == A+V*t:
        print('YES')
        exit()
print('NO')
a,v= input().split()
a=int(a)
v=int(v)
b,w= input().split()
b=int(b)
w=int(w)
t= int(input())
if (a + v*t) >= (b+w*t):
  print("YES")
else:
  print("NO")
import sys
a,v=list(map(int,input().split()))
b,w=list(map(int,input().split()))
t=int(input())
if v-w==0:
  if a==b:
    print("YES")
  else:
    print("NO")
  sys.exit()
temp=(b-a)/(v-w)
if temp<0 or temp>t:
  print("NO")
else:
  print("YES")
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
velocity = v-w
dist = b-a
if velocity == 0:
    print('NO')
elif v<w :
    print('NO')
elif abs(dist) % velocity != 0 :
    print('NO')
elif abs(dist) // velocity >t :
    print('NO')
else :
    print('YES')
import math
from sys import stdin,stdout
#% 998244353
from heapq import heapify,heappop,heappush
import collections


a,s1=list(map(int,stdin.readline().split()))
b,s2=list(map(int,stdin.readline().split()))
T = int(stdin.readline())
if s1==s2:
    print("NO")
elif s1>s2:
    if a>b:
        print("NO")
    else:
        d=b-a
        if d/(s1-s2)<=T:
            print("YES")
        else:
            print("NO")
else:
    print("NO")
def main():
    a,v = map(int,input().split())
    b,w = map(int,input().split())
    t = int(input())

    a += 10**9
    b += 10**9
    if v == w:
        print('NO')
        return 0
    if a > b:
        print('NO')
    elif (b-a)%(v-w) != 0:
        print('NO')
    elif 0 <= (b-a)/(v-w) <= t:
        print('YES')
    else:
        print('NO')

if __name__ == '__main__':
    main()
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())

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

a_x = a+v*t
b_x = b + w*t
if a_x >= b_x:
    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()
if A > B:
  t1 = A
  A = B
  B = t1
  t2 = V
  V = W
  W = t2
if V < W:
  print("NO")
  exit()
if (A + V*T) - (B + W*T) >= 0:
  print("YES")
  exit()
else:
  print("NO")
  exit()
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:
    t = diff_dist / diff_v
    if t > 0:
        #if abs(diff_dist) % abs(diff_v) == 0:
            #if t <= T:
        flag = True
if flag:
    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 == 0:
    if A == B:
        print('YES')
    else:
        print('NO')
    exit()

t = (A-B)/(W-V)

if t < 0:
    print('NO')
    exit()

if t<=T:
    print('YES')
else:
    print('NO')
import sys
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
cnt = 0
if a>b or w>v:
    print('NO')
    sys.exit()
for tt in range(t):
    res = (w - v) * tt + (b - a)
    if res == 0:
        cnt = 1
        break

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

l = b-a
v_l = v-w
if l > 0:
  if l <=( v_l * t):
    print("YES")
  else:
    print("NO")
else:
  if l >= (v_l * t):
    print("YES")
  else:
    print("NO")
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if V * T + A >= W * T + B:
    print('Yes')
else:
    print('No')
#デフォルト
import itertools
from collections import defaultdict
import collections
import math
import sys
sys.setrecursionlimit(200000)
mod = 1000000007

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

sub = abs(b - a)
if sub == 0:
    print("YES")
else:
    ss = v - w
    if ss < 1:
        print("NO")
    else:
        if sub % ss == 0:
            if sub / ss <= t:
                print("YES")
            else:
                print("NO")
        else:
            print("NO")
def iput(): return int(input())
def mput(): return map(int, input().split())
def lpit(): return list(map(int, input().split()))

def solve():
    a, v = mput()
    b, w = mput()
    t = iput()
    if v == w:
        print("NO")
    elif abs(a - b) / (v - w) <= t:
        print("YES")
    else:
        print("NO")
    return 0

if __name__ == "__main__":
    solve()
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 = [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()
#print((b-a) / (v-w))
if (b-a) / (v-w) <= t:
  print("YES")
else :
  print("NO")
import math
import sys
a,v=(int(x) for x in input().split())
b,w=(int(x) for x in input().split())
t = int(input())

e1=pow(10, -9)
e2=pow(10, 9)

if (a<e1)or(e2<a)or(b<e1)or(e2<b)or(v<1)or(e2<v)or(w<1)or(e2<w)or(t<1)or(e2<t)or(a==b):
    sys.exit(0)

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

if ab<=0:
    print("YES")
else :
    print("NO")
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
y1=(v-w)
x1=(b-a)
if(x1==0):
    f=1
elif(y1==0):
    f=0
elif(x1%y1==0):
    x=x1//y1
    if 0<=x<=t:
        f=1
    else:
        f=0
else:
    f=0
if(f==1):
    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(0)

n = abs(a - b)
m = abs(v - w)
if n % m == 0:
    if n // m <= t or m // n <= t:
        print('YES')
    else:
        print('NO')
else:
    print('NO')
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())

eva=False

for t in range(1,T+1):
    if B+W*t==A+V*t:
        eva=True
        break
if eva:
    print("YES")
else:
    print("NO")
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:
    t = diff_dist / diff_v
    if t > 0 and diff_v > 0:
        #if abs(diff_dist) % abs(diff_v) == 0:
        if t <= T:
            flag = True
if flag:
    print('YES')
else:
    print('NO')
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())

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

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

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

    if (v-w) > 0:
        x = (b-a)/(v-w)
    else:
        return 'NO'
    
    if abs(x) >= 1 and abs(x) <= t and x*v + a == x*w + b:
        return 'YES'

    return 'NO'


print(solve())
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
for i in range(t):
    a+=v
    b+=w
    if a>=b:
        print('YES')
        break
    else:
        print('NO')
        break
import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
# do magic here
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
distA = v*t
distB = w*t

# diff = abs(a-b)

if a < b:
    if a+distA >= b+distB:
        print("YES")
    else:
        print("NO")
else:
    if a-distA >= b-distB:
        print("YES")
    else:
        print("NO")
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
x=a+v*t
y=b+w*t
if x>y or x==y:
    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")

for i in range(1,t+1):
    if a < b:
        a = a + v
        b = b + w
    else:
        a = a - v 
        b = 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())

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

lange = B - A
s = V - W

res = 0

if s != 0:
    tmp = lange / s
    if tmp.is_integer() and tmp <= T and tmp >= 0:
        res = 1

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

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