#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <ostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
#define rep(i,a,b) for (int i=(a);i<(b);i++)
#define rev(i,a,b) for (int i=(a)-1;i>=b;i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef queue<int> qi;
typedef vector<int> vi;
typedef vector<string> vs;
int dx[4] = { 0, 1, 0, -1 };
int dy[4] = { 1, 0, -1, 0 };

int a[3], b[3];

bool check() {
	if(a[0] < b[0]) return false;
  else if(a[0] == b[0] && a[1] < b[1]) return false;
  else if(a[0] == b[0] && a[1] == b[1] && a[2] < b[2]) return false;
	return true;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	scanf("%d.%d.%d", &a[0], &a[1], &a[2]);
	scanf("%d.%d.%d", &b[0], &b[1], &b[2]);

	if(check()) cout << "YES" << endl;
	else cout << "NO" << endl;

	return 0;
}