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.Scanner;
import java.util.Arrays;
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String inputA = scanner.nextLine();
        String inputB = scanner.nextLine();
        char[] arrayA = inputA.toCharArray();
        char[] arrayB = inputB.toCharArray();
        Arrays.sort(arrayA);
        Arrays.sort(arrayB);

        String desStr = new String(arrayA);
        char[] tmpRevArray = arrayB;
        StringBuilder revStr = new StringBuilder();
        for(int i=tmpRevArray.length-1; i>=0; i--) {
            revStr.append(Character.toString(tmpRevArray[i]));
        }

        if(desStr.compareTo(revStr.toString()) >= 0) {
            System.out.println("No");
        } else {
            System.out.println("Yes");
        }
    }
}
