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
import java.util.*;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String s = sc.next();
        String t = sc.next();

        char[] cs = new char[s.length() + 1];
        for (int i=0; i<s.length(); i++) {
            cs[i] = s.charAt(i);
        }
        cs[s.length()] = 200;
        Arrays.sort(cs);
        cs[s.length()] = 0;

        char[] ts = new char[t.length() + 1];
        for (int i=0; i<t.length(); i++) {
            ts[i] = t.charAt(i);
        }
        Arrays.sort(ts);

        for (int i=0; i<s.length() + 1; i++) {
            if (cs[i] < ts[t.length() - i]) {
                System.out.println("Yes");
                return;
            } else if (cs[i] == ts[t.length() -i]) {
                continue;
            } else {
                System.out.println("No");
                return;
            }
        }
        System.out.println("No");
    }
}
