#include <iostream>
#include <cstdio>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <map>
#include <functional>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <typeinfo>
#define PI 3.14159265359
#define INF 99999999;
#define rep(i, n) for(int i=0; i<n; i++)
#define REP(n) rep(i, n)
#define EPS 1e-10
typedef long long ll;
using namespace std;
typedef pair<int, int> P;

double distanceAB(double xa, double ya, double xb, double yb);

/*
class Target
{
public:
	vector <string> draw(int n)
	{

	}
};
*/



int main()
{
	int A0, B0, C0, A1, B1, C1, kaseki_ver, ver;
	
	scanf("%d.%d.%d", &A0, &B0, &C0);
	scanf("%d.%d.%d", &A1, &B1, &C1);
	
	kaseki_ver = 1000000 * A0 + 1000 * B0 + C0;
	ver = 1000000 * A1 + 1000 * B1 + C1;
	
	if (ver <= kaseki_ver)
	{
		cout << "YES" << endl;
	} else {
		cout << "NO" << endl;
	}
	
	return 0;
}



double distanceAB(double xa, double ya, double xb, double yb)
{
	return sqrt((xb-xa)*(xb-xa) + (yb-ya)*(yb-ya));
}