#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <cstdlib>
#include <stack>
#include <queue>
#include <cmath>

#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define repp(i,j,k) for(int i=j;i>=k;i--)
#define llrep(i,j,k) for(long long int i=j;i<(long long int)k;i++)
#define Sort(x) sort(x.begin(),x.end()); 
#define vi vector<int>
#define vvi vector<vector<int>> 
#define ll long long
int mod=1e9+7;
const int INF = 100000000;

using namespace std;

void p(int x) {
	cout << x << endl;
}

void pp(string s) {
	cout << s << endl;
}




int main(void) {
	int x;
	int sum1 = 0, sum2 = 0;
	char c;
	cin >> x>>c;
	sum1 += 1000000 * x;
	cin >> x >> c;
	sum1 += 1000 * x;
	cin >> x;
	sum1 += x;

	cin >> x >> c;
	sum2 += 1000000 * x;
	cin >> x >> c;
	sum2 += 1000 * x;
	cin >> x;
	sum2 += x;
	if (sum1 >= sum2)cout << "YES" << endl;
	else cout << "NO" << endl;
	
	return 0;
}