There is a card game called "Durak", which means "Fool" in Russian. The game is quite popular in the countries that used to form USSR. The problem does not state all the game's rules explicitly — you can find them later yourselves if you want.

To play durak you need a pack of 36 cards. Each card has a suit ("S", "H", "D" and "C") and a rank (in the increasing order "6", "7", "8", "9", "T", "J", "Q", "K" and "A"). At the beginning of the game one suit is arbitrarily chosen as trump. 

The players move like that: one player puts one or several of his cards on the table and the other one should beat each of them with his cards.

A card beats another one if both cards have similar suits and the first card has a higher rank then the second one. Besides, a trump card can beat any non-trump card whatever the cards’ ranks are. In all other cases you can not beat the second card with the first one.

You are given the trump suit and two different cards. Determine whether the first one beats the second one or not.
The first line contains the tramp suit. It is "S", "H", "D" or "C".

The second line contains the description of the two different cards. Each card is described by one word consisting of two symbols. The first symbol stands for the rank ("6", "7", "8", "9", "T", "J", "Q", "K" and "A"), and the second one stands for the suit ("S", "H", "D" and "C").
H
QH 9S
YES
S
8D 6D
YES
C
7H AS
NO
C
KC 9C
YES
D
7D KD
NO
H
7H KD
YES
D
AS AH
NO
H
KH KS
YES
C
9H 6C
NO
C
9H JC
NO
D
TD JD
NO
H
6S 7S
NO
D
7S 8S
NO
S
8H 9H
NO
C
9D TD
NO
H
TC JC
NO
C
JH QH
NO
H
QD KD
NO
D
KS AS
NO
S
AH 6H
YES
H
7D 6D
YES
S
8H 7H
YES
D
9S 8S
YES
S
TC 9C
YES
H
JS TS
YES
S
QD JD
YES
D
KH QH
YES
H
AD KD
YES
H
QS QD
NO
C
TS TH
NO
C
6C 6D
YES
H
8H 8D
YES
S
7D 7S
NO
H
JC JH
NO
H
8H 9C
YES
D
9D 6S
YES
C
JC AH
YES
S
AS KD
YES
S
7S JS
NO
H
TH 8H
YES
S
7S QS
NO
C
KC QC
YES
S
AD 9S
NO
D
7H 8D
NO
H
JC 9H
NO
C
7S AC
NO
C
8C 7C
YES
H
9D 8S
NO
D
AC KS
NO
H
8C QH
NO
S
7S TS
NO
C
AH 6S
NO
S
KS QS
YES
H
AC QC
YES
S
9H 8D
NO
S
TS JS
NO
S
8H 7C
NO
C
AH 6S
NO
S
7S QS
NO
C
AH 6S
NO
S
TS KS
NO
C
TH KH
NO
H
9C 6D
NO
H
9C 8D
NO
H
TH AH
NO
H
TH JH
NO
H
QS 9C
NO
H
KC AC
NO
H
AH KH
YES
H
KS QS
YES
C
AD KS
NO
H
QS 9C
NO
H
9D 7S
NO
D
6D 9S
YES
H
AH KH
YES
H
KC AC
NO
D
8S 6C
NO
S
AC KC
YES
# pylint: disable=unused-variable
# pylint: enable=too-many-lines
# * Just believe in yourself


# @ Author @CAP
# import numpy
import os
import sys
from io import BytesIO, IOBase
import math as M
import itertools as ITR
from collections import defaultdict as D
from collections import Counter as C
from collections import deque as Q
import threading
from functools import lru_cache, reduce
from functools import cmp_to_key as CMP
from bisect import bisect_left as BL
from bisect import bisect_right as BR
import random as R
import string
import cmath, time

enum = enumerate
start_time = time.time()

# * Variables

MOD = 1_00_00_00_007
MA = float("inf")
MI = float("-inf")

# * Graph 8 direction
di8 = ((1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0), (-1, -1), (0, -1), (1, -1))

# * Graph 4 direction
di4 = ((1, 0), (0, 1), (-1, 0), (0, -1))

# * Stack increment


def increase_stack():
    sys.setrecursionlimit(2 ** 32 // 2 - 1)
    threading.stack_size(1 << 27)
    # sys.setrecursionlimit(10**6)
    # threading.stack_size(10**8)
    # t = threading.Thread(target=main)
    # t.start()
    # t.join()


# * Region Funtions


def binary(n):
    return bin(n)[2:]


def decimal(s):
    return int(s, 2)


def pow2(n):
    p = 0
    while n > 1:
        n //= 2
        p += 1
    return p


def maxfactor(n):
    q = []
    for i in range(1, int(n ** 0.5) + 1):
        if n % i == 0:
            q.append(i)
    if q:
        return q[-1]


def factors(n):
    q = []
    for i in range(1, int(n ** 0.5) + 1):
        if n % i == 0:
            q.append(i)
            q.append(n // i)
    return list(sorted(list(set(q))))


def primeFactors(n):
    l = []
    while n % 2 == 0:
        l.append(2)
        n = n / 2
    for i in range(3, int(M.sqrt(n)) + 1, 2):
        while n % i == 0:
            l.append(i)
            n = n / i
    if n > 2:
        l.append(int(n))
    l.sort()
    return l


def isPrime(n):
    if n == 1:
        return False
    else:
        root = int(n ** 0.5)
        root += 1
        for i in range(2, root):
            if n % i == 0:
                return False
        return True


def seive(n):
    a = []
    prime = [True for i in range(n + 1)]
    p = 2
    while p * p <= n:
        if prime[p] == True:
            for i in range(p ** 2, n + 1, p):
                prime[i] = False
        p = p + 1
    for p in range(2, n + 1):
        if prime[p]:
            a.append(p)
    prime[0] = prime[1] = False
    return a, prime


def maxPrimeFactors(n):
    maxPrime = -1
    while n % 2 == 0:
        maxPrime = 2
        n >>= 1
    for i in range(3, int(M.sqrt(n)) + 1, 2):
        while n % i == 0:
            maxPrime = i
            n = n / i
    if n > 2:
        maxPrime = n
    return int(maxPrime)


def countchar(s, i):
    c = 0
    ch = s[i]
    for i in range(i, len(s)):
        if s[i] == ch:
            c += 1
        else:
            break
    return c


def str_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
    return q


def lis(arr):
    n = len(arr)
    lis = [1] * n
    maximum = 0

    for i in range(1, n):
        for j in range(0, i):
            if arr[i] > arr[j] and lis[i] < lis[j] + 1:
                lis[i] = lis[j] + 1
                maximum = max(maximum, lis[i])
    return maximum


def gcd(a, b):
    if b == 0:
        return a
    else:
        return gcd(b, a % b)


def agcd(a, *b):

    for i in b:
        a = gcd(a, i)
    return a


def lcm(a, *b):
    val = a
    gc = a
    for i in b:
        gc = gcd(gc, i)
        val *= i
    return val // gc


def ncr(n, r):
    return M.factorial(n) // (M.factorial(n - r) * M.factorial(r))


def npr(n, r):
    return M.factorial(n) // M.factorial(n - r)


# * Make work easy funtions


def IF(c, t, f):
    return t if c else f


def YES(c):
    print(IF(c, "YES", "NO"))


def Yes(c):
    print(IF(c, "Yes", "No"))


def yes(c):
    print(IF(c, "yes", "no"))


def JA(a, sep=" "):
    print(sep.join(map(str, a)))


def JAA(a, s="\n", t=" "):
    print(s.join(t.join(map(str, b)) for b in a))


def PS(a, s=" "):
    print(str(a), end=s)


# * Region Taking Input


def I():
    return int(inp())


def F():
    return float(inp())


def LI():
    return list(map(int, inp().split()))


def LF():
    return list(map(float, inp().split()))


def MATI(n):
    return [LI() for i in range(n)]


def MATS(n):
    return [list(inp()) for i in range(n)]


def IV():
    return map(int, inp().split())


def FV():
    return map(float, inp().split())


def LS():
    return list(inp())


def S():
    return inp()


# * Region Fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
inp = lambda: sys.stdin.readline().rstrip("\r\n")


# >==================================== Write The Useful Code Here ============================

# >Make it one if there is some test cases
TestCases = 0  # >=====================
# > =======================================
"""
> Sometimes later becomes never. Do it now.
! Be Better than yesterday.
!Your limitation—it’s only your imagination.
> Push yourself, because no one else is going to do it for you.
? The harder you work for something, the greater you’ll feel when you achieve it.
! Great things never come from comfort zones.
! Don’t stop when you’re tired. Stop when you’re done.
> Do something today that your future self will thank you for.
? It’s going to be hard, but hard does not mean impossible.
! Sometimes we’re tested not to show our weaknesses, but to discover our strengths.
"""
# @  Goal is to get Candidate Master


def solve():
    
    trump=S()
    p,q=S().split()
    flag=False
    lookup={'1':1,'2':2,'3':3,'4':4,'5':5,'6':6,'7':7,'8':8,'9':9,'10':10,'T':11,'J':12,'Q':13,'K':14,'A':15}

    if p[-1]==q[-1]:
        rank=p[:-1]
        pank=q[:-1]
        if lookup[rank]>lookup[pank]:
            flag=True
    else:
        if p[-1]==trump:
            flag=True

    YES(flag)


# ! This is the Main Function


def main():
    flag = 1
    #! Checking we are offline or not
    try:
        sys.stdin = open(
            "c:/Users/dell/Documents/python/CodeForces/contest-div-2/input.txt",
            "r",
        )
        sys.stdout = open(
            "c:/Users/dell/Documents/python/CodeForces/contest-div-2/output.txt",
            "w",
        )
    except:
        flag = 0

    t = 1
    if TestCases:
        t = I()
    for test in range(1, t + 1):
        solve()

    if flag:
        print("Time: %.4f sec" % (time.time() - start_time))
        localtime = time.asctime(time.localtime(time.time()))
        print(localtime)
        sys.stdout.close()


# !  End Region


if __name__ == "__main__":

    # ? Incresing Stack Limit
    # increase_stack()

    #! Calling Main Function
    main()