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.

Constraints

* The lengths of s and t are between 1 and 100 (inclusive).
* s and t consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:


s
t


Output

If it is possible to satisfy s' < t', print `Yes`; if it is not, print `No`.

Examples

Input

yx
axy


Output

Yes


Input

ratcode
atlas


Output

Yes


Input

cd
abc


Output

No


Input

w
ww


Output

Yes


Input

zzz
zzz


Output

No
a = list(raw_input())
b = list(raw_input())

a = sorted(a)
b = sorted(b)
new_a = []
new_b = []
for x in a:
  if ord(x) >= ord('a') and ord(x) <= ord('z'):
     new_a.append(x)
      
for x in b:
  if ord(x) >= ord('a') and ord(x) <= ord('z'):
     new_b.append(x)

new_a = new_a
new_b = new_b[::-1]
la = len(new_a)
lb = len(new_b)

for x in range(101):
  if x >= lb:
    print "No"
    exit(0)
  if x >= la:
    print "Yes"
    exit(0)
  if ord( new_a[x] ) > ord( new_b[x] ):
    print "No"
    exit(0)
  if ord( new_a[x] ) < ord( new_b[x] ):
    print "Yes"
    exit(0)
