#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,n) for(int i=0;i<n;i++)

const ll mod = ll(1e9) + 7;
const int INF = 1<<29;

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