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

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

            char[] S = s.toCharArray();
            Arrays.sort(S);

            char[] T = t.toCharArray();
            Arrays.sort(T);
            for (int l = 0, r = T.length - 1; l < r; l++, r--) {
                char swap = T[l];
                T[l] = T[r];
                T[r] = swap;
            }

            System.out.println(new String(S).compareTo(new String(T)) < 0 ? "Yes" : "No");
        }
    }
}
