p03486 AtCoder Beginner Contest 082 - Two Anagrams_13733
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
from collections import Counter
s = raw_input()
t = raw_input()

s=sorted(s)
t=sorted(t, reverse=True)

for x in xrange(min(len(s), len(t))):
    if s < t:
        print "Yes"
        break
    elif s>t:
        print "No"
        break
else:
    if len(s) < len(t):
        print "Yes"
    else:
        print "No"
