#include <bits/stdc++.h>
#include "bits/stdc++.h"
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <unordered_map>
#include <string.h>
#include <utility>

typedef long long ll;
const int INF = 1e8;

#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;

typedef pair<int, int> P;

int main() {

	string s, ss;
	cin >> s >> ss;

	if (s[0] - '0' < ss[0] - '0') {
		cout << "NO" << endl;
		return 0;
	} else if (s[2] - '0' < ss[2] - '0') {
		cout << "NO" << endl;
		return 0;
	}else if(s[4] - '0' < ss[4] - '0'){
		cout << "NO" << endl;
			return 0;
	}else {
		cout<<"YES"<<endl;
	}
	return 0;


}