#include <bits/stdc++.h>
using namespace std;
vector<long long int> sieve;
vector<long long int> *Sieve(int N) {
  const long long int maxn = N;
  sieve.resize(maxn);
  for (long long int(i) = 0; (i) < (maxn); ++(i)) sieve[i] = 1;
  sieve[1] = 0;
  sieve[0] = 0;
  for (long long int(i) = 2; (i) <= (maxn); (i) += (1))
    if (1 == sieve[i])
      for (long long int j = i * i; j < maxn; j += i) sieve[j] = 0;
  vector<long long int> *primes = new vector<long long int>();
  primes->push_back(2);
  for (int i = 3; i < maxn; i += 2)
    if (sieve[i]) {
      primes->push_back(i);
    }
  return primes;
}
long long int extended_GCD(long long int a, long long int b, long long int &x,
                           long long int &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  long long int x1, y1;
  long long int gcd = extended_GCD(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return gcd;
}
long long int power(long long int a, long long int b,
                    long long int m = 1000000007) {
  a %= m;
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = res * a % m;
    a = a * a % m;
    b >>= 1;
  }
  return res;
}
long long int modinv(long long int a, long long int mod = 1000000007) {
  long long int x, y;
  extended_GCD(a, mod, x, y);
  if (x < 0) x += mod;
  return x;
}
bool prime(int n) {
  int c = 0;
  for (int i = 2; (i * i) <= n; i++) {
    if (n % i == 0) {
      c++;
      return false;
    }
  }
  if (c == 0) return true;
}
int vis[10001];
void solve() {
  char t;
  cin >> t;
  string s1, s2;
  cin >> s1 >> s2;
  char a[17] = {'2', '3', '4', '5', '6', '7', '8', '9', 'T',
                'J', 'Q', 'K', 'A', 'S', 'H', 'D', 'C'};
  map<char, int> m;
  for (long long int(i) = 0; (i) < (17); ++(i)) {
    m[a[i]] = i;
  }
  if (s1[1] == t && s2[1] == t) {
    if (m[s1[0]] > m[s2[0]])
      cout << "YES\n";
    else
      cout << "NO\n";
  } else if (s1[1] == t) {
    cout << "YES\n";
  } else if (s2[1] == t)
    cout << "NO\n";
  else {
    if (m[s1[1]] == m[s2[1]]) {
      if (m[s1[0]] > m[s2[0]])
        cout << "YES\n";
      else
        cout << "NO\n";
    } else
      cout << "NO\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}
