x, y, z, t_1, t_2, t_3 = [int(i) for i in input().split()]
total_1 = abs(x - y) * t_1
l = abs(x - z) * t_2
total_2 = l + (abs(x - y) * t_2 + t_3 * 3)
if total_2 > total_1:
print('NO')
else:
print('YES')#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,z,t1,t2,t3;
cin>>x>>y>>z>>t1>>t2>>t3;
int a=abs(z-x)*t2+3*t3+abs(y-x)*t2;
int b=abs(x-y)*t1;
if(b>=a){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
}
}
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |