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.*;

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

        List<Character> sList = new ArrayList<>();
        List<Character> tList = new ArrayList<>();
        for (char c : s.toCharArray()) { sList.add(c); }
        for (char c : t.toCharArray()) { tList.add(c); }
        Collections.sort(sList);
        Collections.sort(tList, Collections.reverseOrder());

        StringBuilder sSorted = new StringBuilder();
        StringBuilder tReverseSorted = new StringBuilder();
        for (char c : sList) { sSorted.append(c); }
        for (char c : tList) { tReverseSorted.append(c); }

        System.out.println(sSorted.toString().compareTo(tReverseSorted.toString()) < 0 ? "Yes" : "No");
    }
}
