#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996) 

typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;

int a[6], g;
int c[6]={500,100,50,10,5,1};

bool dfs( int k, int rest )
{
    if(k==6) {
        if(rest==0) return true;
        else return false;
    }

    int i;
    for(i=0; i<=a[k]; i++) {
        int tmp=rest-i*c[k];
        if(tmp==0) return true;
        if(tmp>0 && dfs(k+1, tmp)) {
            return true;
        }
    }

    return false;
}

int main(int argc, char* argv[])
{
    int i;
    for(i=0; i<6; i++) {
        scanf("%d", &a[i]);
    }
    scanf("%d", &g);
    bool bOk = dfs( 0, g );
    if(bOk) {
        printf("YES\n");
    }
    else {
        printf("NO\n");
    }
    return 0;
}