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 scan = new Scanner(System.in);
        
        char[] a = scan.nextLine().toCharArray();
        char[] b = scan.nextLine().toCharArray();

        Arrays.sort(a);
        Arrays.sort(b);

        boolean flg = false;
        for(int i=0; i<a.length; i++){
            int j = b.length - i - 1;
            if(j < 0){
                break;
            }else if(a[i] < b[j]){
                flg = true;
                break;
            }else if(a[i] == b[j] && (i+1) == a.length && a.length < b.length){
                flg = true;
            }
        }
        if(flg) System.out.println("Yes");
        else System.out.println("No");

        scan.close();
        
    }
}