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.*;

class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        String t = sc.next();
        char[] S = s.toCharArray();
        char[] T = t.toCharArray();
        Arrays.sort(S);
        Arrays.sort(T);
        for(int i=0;i<=T.length/2-1;i++){
            char temp = T[i];
            T[i] = T[T.length-1-i];
            T[T.length-1-i] = temp;
        }
        String ans = "No";
        int i=0;
        while(i<Math.min(T.length,S.length)){
            if(S[i]<T[i]){
                ans = "Yes";
                break;
            }
            if(S[i]>T[i]){
                break;
            }
            i++;
        }
        if(i==Math.min(T.length,S.length)&&S.length<T.length) ans = "Yes";
        System.out.println(ans);
    }
}