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);
    StringBuffer s = new StringBuffer(sc.next());
    StringBuffer t = new StringBuffer(sc.next());
    for(int i=0;i<s.length();i++){
      for(int j=i;j>0;j--){
        if(s.charAt(j)<s.charAt(j-1)){
          char temp = s.charAt(j);
          s.setCharAt(j,s.charAt(j-1));
          s.setCharAt(j-1,temp);
        }else{
          break;
        }
      }
    }
    for(int i=0;i<t.length();i++){
      for(int j=i;j>0;j--){
        if(t.charAt(j)>t.charAt(j-1)){
          char temp = t.charAt(j);
          t.setCharAt(j,t.charAt(j-1));
          t.setCharAt(j-1,temp);
        }else{
          break;
        }
      }
    }
    if(s.toString().compareTo(t.toString())<0){
      System.out.println("Yes");
    }else{
      System.out.println("No");
    }
  }
}