#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}


int main(int argc, char const *argv[]) {
  ll a, b, c, d, e, f;std::cin >> a >> b >> c >> d >> e >> f;
  ll g;std::cin >> g;
  re(i, a+1){
    re(j, b+1){
      re(k, c+1){
        re(x, d+1){
          re(y, e+1){
            re(z, f+1){
              ll tmp = i*500+j*100+k*50+x*10+y*5+z;
              if(tmp==g){
                std::cout << "YES" << '\n';
                return 0;
              }
            }
          }
        }
      }
    }
  }
  std::cout << "NO" << '\n';
  return 0;
}