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.Scanner;
import java.util.Arrays;
public class Main {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        
        String s=sc.next();
        int nums=s.length();
        String[] S=new String[nums];
        for(int i=0;i<nums;i++){
            S[i]=s.substring(i,i+1);
        }
        s="";
        Arrays.sort(S);
        for(int i=0;i<nums;i++){
            s+=S[i];
        }
        
        String t=sc.next();
        int numt=t.length();
        String[] T=new String[numt];
        for(int i=0;i<numt;i++){
            T[i]=t.substring(i,i+1);
        }
        t="";
        Arrays.sort(T);
        for(int i=0;i<numt;i++){
            t+=T[numt-i-1];
        }
        
        if(s.compareTo(t)<0){
            System.out.println("Yes");
        }else{
            System.out.println("No");
        }
    }
}