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 sc = new Scanner(System.in);
        int i = 0, j = 0;

        String message = sc.next();
        String re_message = sc.next();
        char[] chmessage = message.toCharArray();
        char[] chre_message = re_message.toCharArray();
        char temp[];
        temp = new char[chre_message.length];

        Arrays.sort(chmessage);
        Arrays.sort(chre_message);
        for (i = 0; chre_message.length > i; i++) {
            temp[chre_message.length - i - 1] = chre_message[i];
        }
        String str1 = String.valueOf(chmessage);
        String str2 = String.valueOf(temp);
        if (str1.compareTo(str2) < 0) {
            System.out.println("Yes");
        }
        if (str1.compareTo(str2) >= 0) {
            System.out.println("No");
        }

    }

}
