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.Collections;
import java.util.Scanner;

 class Main {
    public static void main(String[]args){
        Scanner scan = new Scanner(System.in);
        char s1[] = scan.next().toCharArray();
        char s2[] = scan.next ().toCharArray();
        Character[] newarr = new Character[s2.length];
        int i =0 ;
        for(char ch : s2){
            newarr[i++] = Character.valueOf(ch) ; 
        }
        Arrays.sort(s1 );
        Arrays.sort( newarr,Collections.reverseOrder());
        StringBuilder sb = new StringBuilder();
        for(Character x : newarr){
            sb.append(x);
        }
         
        //System.out.println(String.valueOf(s1)  + " "+sb.toString());
        if(String.valueOf(s1).compareTo(sb.toString()) < 0){
            System.out.println("Yes");
        }
        else{
            System.out.println("No");
        }
        
        
    }
    
    
}
