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 java.util.stream.*;
import static java.util.Comparator.*;

public class Main{
  public static void main(String[] args) throws Exception{
	Scanner sc = new Scanner(System.in);
    char[] s = sc.nextLine().toCharArray();
    char[] t = sc.nextLine().toCharArray();
    List<Character> charListS = new ArrayList<>();
    List<Character> charListT = new ArrayList<>();
    for(char x : s){
        charListS.add(x);
    }
    for(char y : t){
        charListT.add(y);
    }
    String str1 = charListS.stream().sorted(naturalOrder()).collect(StringBuilder::new,StringBuilder::append,StringBuilder::append).toString();
    String str2 = charListT.stream().sorted(reverseOrder()).collect(StringBuilder::new,StringBuilder::append,StringBuilder::append).toString();
    String result = str1.compareTo(str2) < 0 ? "Yes" : "No";
    System.out.println(result);
  }
}