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


public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String A = sc.nextLine();
        String B = sc.nextLine();
        String A_new = null;
        String B_new = null;
        String []A_array = A.split("");
        String []B_array = B.split("");
        Arrays.sort(A_array);
        Arrays.sort(B_array,Comparator.reverseOrder());
        for(int i = 0; i < A_array.length; i++){
            A_new += A_array[i];
        }
        for(int i = 0; i < B_array.length; i++){
            B_new += B_array[i];
        }
        if(A_new.compareTo(B_new) < 0){
            System.out.println("Yes");
        }else{
            System.out.println("No");
        }
    }
}