样例没过蒟蒻求助/

// Author: gsczl71
// Copyright (c) 2024 gsczl71 All rights reserved.
// Problem: [ABC223E] Placing Rectangles
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/AT_abc223_e
// Memory Limit: 1 MB
// Time Limit: 2000 ms
// Date: 2024-03-26 22:01:24

// #pragma GCC optimize(2,3,"Ofast","inline")
#include<bits/stdc++.h>
#define ll long long
#define i128 __int128
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<long long, long long>
#define fs first
#define sc second
#define x0 _x0_
#define y1 _y1_
#define endl '\n'
#define re register
#define pb push_back
#define vi vector<int>
#define pq priority_queue
#define mem(a,x) memset((a),(x),sizeof(a))
#define debug puts("AK IOI")
#define sz(s) (int)(s.size())
#define all(a) a.begin(),a.end()
#define rd(l,r) (myrand()%(r-l+1)+l)
#define print(x) {cout<<x<<endl;return;}
#define ctn(e) if(e) continue
#define brk(e) if(e) break
#define rt(e) if(e) return
#define ll_(e) (1ll*(e))
#define For(x,y,z) for(int x = y;x <= z;x++)
#define For_(x,y,z) for(int x = y;x >= z;x--)
#define get(a,b) ((a+b-1)/b)
using namespace std;
#define int long long
const int mod = 1e9+7;
//const int mod = 998244353;
mt19937 myrand(time(0));
const int inf = 0x3f3f3f3f,N = 2e5+5,M = 1e6+5,K = 3000+5;
const long long linf = 0x3f3f3f3f3f3f3f3f;
int x,y,a,b,c;
void solve(){
	cin>>x>>y>>a>>b>>c;
	int ok=0;
	if((get(a,x)+get(b,x)+get(c,x)<=y)||(get(a,y)+get(b,y)+get(c,y)<=x))ok=1;
	if(((x>get(a,y))&&(get(b,x-get(a,y))+get(c,x-get(a,y))<=y)))ok=1;
	if(((x>get(b,y))&&(get(a,x-get(b,y))+get(c,x-get(b,y))<=y)))ok=1;
	if(((x>get(c,y))&&(get(a,x-get(c,y))+get(b,x-get(c,y))<=y)))ok=1;
	if(((y>get(a,x))&&(get(b,y-get(a,x))+get(c,y-get(a,x))<=x)))ok=1;
	if(((y>get(b,x))&&(get(a,y-get(b,x))+get(c,y-get(b,x))<=x)))ok=1;
	if(((y>get(c,x))&&(get(a,y-get(c,x))+get(b,y-get(c,x))<=x)))ok=1;
	if(ok)cout<<"Yes\n";
	else cout<<"No\n";
}
signed main(){
	ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
	int T=1;
//	cin >> T;
	For(_,1,T) solve();
	return 0;
}