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 x = sc.next();
      	char[] x_chars = x.toCharArray();
      	Arrays.sort(x_chars);
      	String x_asc = new String(x_chars);
      
        String y = sc.next();
      	char[] y_chars = y.toCharArray();
      	Arrays.sort(y_chars);
      	String y_asc = new String(y_chars);  
      	String y_desc = new StringBuilder(y_asc).reverse().toString();
      
     	if(x_asc.compareTo(y_desc) < 0)
          System.out.println("Yes");
      	else
          System.out.println("No");

	}
}
