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 S = sc.nextLine();
    String T = sc.nextLine();
    
    List<Character> list1 = new ArrayList<>();
    List<Character> list2 = new ArrayList<>();
    for(int i = 0; i < S.length(); i++){
      list1.add(S.charAt(i));
    }
    for(int i = 0; i < T.length(); i++){
      list2.add(T.charAt(i));
    }
    
    Collections.sort(list1);
    Collections.sort(list2, Collections.reverseOrder());
    
    String s = "";
    String t = "";
    for(int i = 0; i < S.length(); i++){
      s = s + String.valueOf(list1.get(i));
    }
    for(int i = 0; i < T.length(); i++){
      t = t + String.valueOf(list2.get(i));
    }
    
    
    System.out.println(s.compareTo(t) < 0 ? "Yes" : "No");
  }
}