#include <bits/stdc++.h>
using namespace std;

struct Initializer {
  Initializer() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(15);
  }
} initializer;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

// 基本テンプレート
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define ILP while(true)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define MAT(type, c, m, n) vector<vector<type>> c(m, vector<type>(n));for(auto& r:c)for(auto& i:r)cin>>i;
#define FOR(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define RFOR(i,a,b) for(int i=(b)-1; i>=(a); --i)
#define RFORS(i,a,b) for(int i=(b); i>=(a); --i)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPS(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define RREP(i,n) for(int i=(n)-1; i>=0; --i)
#define RREPS(i,n) for(int i=(n); i>=0; --i)
#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))
#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter
#define MP make_pair
#define FI first
#define SE second
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
#define SZ(x) ((int)(x).size())
#define cauto const auto&

// 型
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef pair<string, int> psi;
typedef pair<int, string> pis;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long> vl;
typedef vector<long long> vll;
typedef vector<string> vs;



// Effective std
template<typename C> void remove(vector<C>& c, unsigned int index) { c.erase(c.begin()+index); }
template<typename T> inline istream& operator>>(istream &s, vector<T> &v) { for (T &t : v) s >> t; return s; }
template<typename T> inline ostream& operator<<(ostream &s, const vector<T> &v) { for (const T &t : v) s << t << endl; return s; }
template<typename T> inline bool chmin(T &a, const T &b){if (b < a) {a = b; return true;} return false; }
template<typename T> inline bool chmax(T &a, const T &b){if (a < b) {a = b; return true;} return false; }
#define UNIQUE(v) v.erase( unique(ALL(v)), v.end() );


// 定数
constexpr int PI = (2*acos(0.0));
constexpr int EPS = (1e-9);
constexpr int MOD = (int)(1e9+7);
constexpr int INF = 100000000;


vector<int> split(const string &str, char sep)
{
    vector<int> v;
    stringstream ss(str);
    string buffer;
    while( getline(ss, buffer, sep) ) {
        v.push_back(stoi(buffer));
    }
    return v;
}


int main(){



	string s1, s2; cin >> s1 >> s2;
	vi v1; v1 = split(s1, '.');
	vi v2; v2 = split(s2, '.');

	string s = "NO";

	if (v1[0] > v2[0]) s = "YES";
	else if ((v1[0] == v2[0]) and (v1[1] > v2[1])) s = "YES";
	else if ((v1[0] == v2[0]) and (v1[1] == v2[1]) and (v1[2] >= v2[2])) s = "YES";

	P(s);


    return 0;
}