#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}


signed main(void) {
    int a,b,c,d,e,f,n;
    cin >> a >> b >> c >> d >> e >> f >> n;
    while(n >= 500 && a){
        n -= 500;
        a--;
    }
    while(n >= 100 && b){
        n -= 100;
        b--;
    }
    while(n >= 50 && c){
        n -= 50;
        c--;
    }
    while(n >= 10 && d){
        n -= 10;
        d--;
    }
    while(n >= 5 && e){
        n -= 5;
        e--;
    }
    while(n >= 1 && f){
        n -= 1;
        f--;
    }
    if(n == 0)cout << "YES" << endl;
    else cout << "NO" << endl;
}