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 scan = new Scanner(System.in);

	String s = scan.next();
	String t = scan.next();

	char[] s_ = s.toCharArray();
	char[] t_ = t.toCharArray();
	
	Arrays.sort(s_);
	Arrays.sort(t_);
	
	String s_asc = String.valueOf(s_);
	String t_asc = String.valueOf(t_);

	StringBuffer sb = new StringBuffer(t_asc);
	String t_desc = sb.reverse().toString();

	if(s_asc.compareTo(t_desc) < 0){
	    System.out.println("Yes");
	}else{
	    System.out.println("No");
	}
    }
}
