You are given strings s and t, consisting of lowercase English letters. You will create a string s' by freely rearranging the characters in s. You will also create a string t' by freely rearranging the characters in t. Determine whether it is possible to satisfy s' < t' for the lexicographic order.
s=input()
t=input()
s2 = sorted(s)
t2 = sorted(t,reverse=True)
if s<t:
  print("Yes")
else:
  print("No")
s=input()
t=input()
s2 = sorted(s)
t2 = sorted(t,reverse=True)
if s2<t2:
  print("Yes")
else:
  print("No")