#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 a, b, c, d, e, f, g;

bool ok = false;

void rec(int i, int j, int k, int l, int m, int n){
    int sum = 500*i + 100*j + 50*k + 10*l + 5*m + n;
    if(sum == g){
        ok = true;
        return;
    }
    if(g < sum) return;

    if(i < a) rec(i+1, j, k, l, m, n);
    if(j < b) rec(i, j+1, k, l, m, n);
    if(k < c) rec(i, j, k+1, l, m, n);
    if(l < d) rec(i, j, k, l+1, m, n);
    if(m < e) rec(i, j, k, l, m+1, n);
    if(n < f) rec(i, j, k, l, m, n+1);
    return;
}

int main(){
    cin >> a >> b >> c >> d >> e >> f >> g;
    rec(0, 0, 0, 0, 0, 0);
    if(ok) cout << "YES" << endl;
    else cout << "NO" << endl;
}