#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;int main(){double a1,a2,a3;double b1,b2,b3;int n;cin >>a1 >> a2 >> a3 >>b1 >> b2 >> b3>> n;int cnt = ceil((a1+a2+a3)/5)+ceil((b1+b2+b3)/10);if(cnt > n) cout <<"NO"<<endl;else cout<<"YES"<<endl;
}

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
using namespace std;int main(){string s,t;cin >>s >>t;bool needTree = false,automatonFlag = false;if(s.length() < t.length()) needTree = true;else if(s.length() >t.length()) automatonFlag = true;string str="";for(int i = 0 ; i < s.length(); ++ i ){if(t.find(s[i])!=string::npos) str+=s[i];}map<char,int> strCnt,tCnt;for(int i = 0 ; i < str.length(); ++ i) strCnt[str[i]]++;for(int i = 0 ; i < t.length(); ++ i) tCnt[t[i]]++;if(strCnt.size()!=tCnt.size()) needTree = true;else{for(map<char,int>::iterator iter = tCnt.begin(); iter!=tCnt.end(); iter++){if(iter->second > strCnt[iter->first]) {needTree = true;break;}if(iter->second < strCnt[iter->first]) automatonFlag = true;}}if(needTree) cout<<"need tree"<<endl;else{if(!automatonFlag) cout<<"array"<<endl;else{int i = 0,index = 0;for(int i = 0 ; i <  str.length() && index < t.length(); ++i){if(t[index] == str[i]) index++;}if(index < t.length()) cout<<"both"<<endl;else cout<<"automaton"<<endl;}}
}

#include <iostream>
#include <vector>
#include <algorithm>using namespace std;
int solve(vector<int>& a,int left, int right){if(right< left) return 0;int minv = *min_element(a.begin()+left,a.begin()+right+1);int res = minv, index = left;for(int i = left; i<=right; ++i) a[i]-=minv;for(int i = left; i<= right; ++ i){if(a[i] == 0 ){if(index < i) {res+=solve(a,index,i-1);}index = i+1;}}res+=solve(a,index,right);return min(res,right-left+1);
}int main(){int n;cin >> n ;vector<int> a(n,0);for(int i = 0 ; i < n; ++ i) cin >> a[i];cout<<solve(a,0,n-1)<<endl;
}

#include <iostream>
#include <vector>
#include <cmath>
#include <queue>
#include <functional>
#define LL long longusing namespace std;struct Point{int row;int col;Point(int x=0, int y =0 ):row(x), col(y){}bool operator<(const Point& a) const{return (LL)row*(LL)col > (LL)a.row*(LL)a.col;}
};int main(){int  n, m;LL k;cin >> n >> m >>k;vector<vector<bool> > visit(n+1,vector<bool>(m+1,false));priority_queue<Point> que;que.push(Point(1,1));visit[1][1] = true;LL res = 0;for(int i = 0 ; i <k; ++i){Point tmp = que.top();que.pop();res = (LL)tmp.row*(LL)tmp.col;Point a(tmp.row+1,tmp.col),b(tmp.row,tmp.col+1);if(a.row <= n && a.col<=m && !visit[a.row][a.col]){que.push(a);visit[a.row][a.col] = true;}if(b.row<=n && b.col<=m && !visit[b.row][b.col]) {que.push(b);visit[b.row][b.col] = true;}}cout<<res<<endl;}

#include <iostream>
#include <vector>
#include <algorithm>
#define LL long longusing namespace std;LL n,m,k;LL calc(LL x){LL cnt = 0;for(LL i = 1; i <= n; ++ i ) cnt += min(m,x/i);return cnt;
}int main(){cin >> n >>m >>k;LL left = 1, right = n*m;while(left<=right){LL mid = (left+right)/2;if(calc(mid) >=k) right = mid-1;else left = mid+1;}cout<<right+1<<endl;
}

#include <iostream>
#include <vector>
#include <algorithm>
#include <vector>
#define LL long long
using namespace std;LL limit = 1e5;
vector<LL> divs,res;bool solve(LL x, LL k){if(k == 0 ||  x == 1){res.push_back(x);return res.size() >= limit;}for(int  i = 0 ;i < divs.size(); ++ i){if(divs[i] > x) break;if(x%divs[i] == 0){if(solve(divs[i],k-1)) return true;}}return false;
}int main(){LL x,k;cin >> x >> k;for(LL i = 1; i*i <= x; ++ i){if(x%i == 0){divs.push_back(i);if(i*i != x) divs.push_back(x/i);}}sort(divs.begin(),divs.end());solve(x,k);for(int i = 0 ; i < res.size(); ++ i){if(i) cout<<" ";cout<<res[i];}cout<<endl;return 0;
}