#include<iostream>
#include<string>
#include<cstring>
#include<complex>
#include<vector>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<iomanip>
using namespace std;

#define REP(i, j) for (int i = 0; i < (int)j; ++i)
#define FOR(i, j, k) for (int i = (int)j; i < (int)k; ++i)
#define SORT(v) sort(v.begin(), v.end())
#define REVERSE(v) reverse(v.begin(), v.end())
typedef complex<double> P;
typedef vector<int> VI;
typedef long long LL;
typedef pair<int,int> PII;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int a[3], b[3];
	scanf("%d.%d.%d", &a[0],&a[1],&a[2]);
	scanf("%d.%d.%d", &b[0],&b[1],&b[2]);

	int c = 0;
	REP(i,3) {
		if (a[i] > b[i]) c -= 3 - i;
		if (a[i] < b[i]) c += 3 - i;
	}

	cout << (c <= 0 ? "YES" : "NO") << endl;

	return 0;
}