#include <bits/stdc++.h>
using namespace std;

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

 
int main() {
    int A,B,C,D,E,F,G;
    cin >>A>>B>>C>>D>>E>>F>>G;
    while(G >= 500 && A>0) {
        G -= 500;
        A--;
    }
    while(G >= 100 && B>0) {
        G -= 100;
        B--;
    }
    while(G >= 50 && C>0) {
        G -= 50;
        C--;
    }
    while(G >= 10 && D>0) {
        G -= 10;
        D--;
    }
    while(G >= 5 && E>0) {
        G -= 5;
        E--;
    }
    while(G >= 1 && F>0) {
        G -= 1;
        F--;
    }
    if (G==0) cout << "YES" << endl;
    else cout << "NO" << endl;
    return 0;
}