#include <iostream> #include <string> #include <utility> #include <algorithm> #include <map> #include <set> #include <vector> #include <cmath> #include <cstdlib> #include <queue> #include <stack> #include <iomanip> using namespace std; #define REP(i, n) for(ll i = 0;i < n;i++) #define REPR(i, n) for(ll i = n;i >= 0;i--) #define FOR(i, m, n) for(ll i = m;i < n;i++) #define FORR(i, m, n) for(ll i = m;i >= n;i--) #define REPO(i, n) for(ll i = 1;i <= n;i++) #define ll long long #define INF (ll)1 << 60 #define MINF (-1 * INF) #define ALL(n) n.begin(),n.end() #define MOD (ll)1000000007 #define P pair<ll, ll> ll s[10], ans, m[6] = { 500,100,50,10,5,1 }; int main() { REP(i, 6)cin >> s[i]; cin >> ans; REP(i, 6) { ll now = m[i]; REP(j, s[i]) { if (ans - now >= 0)ans -= now; } } if (ans == 0)cout << "YES" << endl; else cout << "NO" << endl; }