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[]){
        Scanner scanner = new Scanner(System.in);
        char ca[] = scanner.next().toCharArray();
        char cb[] = scanner.next().toCharArray();
        Arrays.sort(ca);
        Arrays.sort(cb);
        for (int i = 1;i <= cb.length;++i){
            if(i > ca.length){
                System.out.println("Yes");
                return;
            }
            if(ca[i - 1] > cb[cb.length - i]){
                System.out.println("No");
                return;
            }
            else if(ca[i - 1] < cb[cb.length - i]){
                System.out.println("Yes");
                return;
            }
        }
        System.out.println("No");
    }
}