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

import javax.lang.model.util.ElementScanner6;

public class Main{
    
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);

        String s = sc.next();
        char[] c1 = s.toCharArray();
        String t = sc.next();
        char[] c2 = t.toCharArray();
        sc.close();

        Arrays.sort(c1);
        Arrays.sort(c2);

        for(int i = 0; i < Math.min(c1.length, c2.length); i++){
            if(c1[i] < c2[c2.length-i-1]){
                System.out.println("Yes");
                return;
            } else if(c1[i] > c2[c2.length-i-1]){
                System.out.println("No");
                return;
            } else
                continue;
        }
        if(c1.length < c2.length)
            System.out.println("Yes");
        else
            System.out.println("No");
    }
}