#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
    int a, b, c, d, e, f, g; cin>>a>>b>>c>>d>>e>>f>>g;
    for(int i1=0; i1<=a; i1++){
        for(int i2=0; i2<=b; i2++){
            for(int i3=0; i3<=c; i3++){
                for(int i4=0; i4<=d; i4++){
                    for(int i5=0; i5<=e; i5++){
                        for(int i6=0; i6<=f; i6++){
                            if(500*i1+100*i2+50*i3+10*i4+5*i5+i6==g){
                                cout<<"YES"<<endl; return 0;
                            }
                        }
                    }
                }
            }
        }
    }
    cout<<"NO"<<endl;
    return 0;
}