#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define bit(n) (1LL<<(n))
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using namespace std;
typedef long long ll;
const ll INF = 1e9;
typedef pair<int, int> P;



int main(){
    int a, b, c, d, e, f, g;
    cin >> a >> b >> c >> d >> e >> f >> g;
    rep(i, a+1){
        rep(j, b+1){
            rep(k, c+1){
                rep(l, d+1){
                    rep(m, e+1){
                        rep(n, f+1){
                            if(500*i + 100*b + 50*c + 10*d + 5*e + f == g){
                                cout <<  "YES" << endl;
                                return 0;
                            }
                        }
                    }
                }
            }
        }
    }
    cout << "NO" << endl; 
}