#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<numeric>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i = m; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a)  (a).rbegin(),(a).rend()
typedef long long LL;
template<class T> inline void chmax(T & a, T b) { if (a < b) { a = b; } }
template<class T> inline void chmin(T& a, T b) { if (a > b) { a = b; } }
template<class T> void print_vector(vector<T> vec) {
	cout << "[ ";
	for (int i = 0; i < vec.size(); i++) {
		cout << vec[i] << " ";
	}
	cout << "]" << endl;
}
template<class T> void print_pair_vector(vector<pair<T, T> > vec) {
	cout << "[ ";
	for (int i = 0; i < vec.size(); i++) {
		cout << "(" << vec[i].first << "," << vec[i].second << ") ";
	}
	cout << "]" << endl;
}

vector<int> currency = { 500,100,50,10,5,1 };

int main(void) {
	vector<pair<int, int> > coins(6);
	rep(i, 6) {
		coins[i].first = currency[i];
		cin >> coins[i].second;
	}
	int G;
	cin >> G;
	
	while (true) {
		for (int i = 0; i < coins.size(); i++) {
			if (coins[i].first <= G and coins[i].second > 0) {
				G -= coins[i].first;
				coins[i].second--;
				break;
			}

			if (i == coins.size() - 1) {
				goto OUTPUT;
			}
		}
	}

	OUTPUT:
	if (G == 0) {
		cout << "YES" << endl;
	}
	else {
		cout << "NO" << endl;
	}

	return 0;
}