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.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		String s = scan.next();
		String t = scan.next();
		int s_length = s.length();
		int t_length = t.length();
		String[] s_list = new String[s_length];
		String[] t_list = new String[t_length];
		String message = "No";
		int i = 0;
		for(i = 0; i < s_length; i++) {
			s_list[i] = s.charAt(i) + "";
		}
		for(i = 0; i < t_length; i++) {
			t_list[i] = t.charAt(i) + "";
		}
		Arrays.sort(s_list);
		Arrays.sort(t_list);
		for(i = 0; i < s_length && i < t_length; i++) {
			if(s_list[i].compareTo(t_list[t_length - i - 1]) < 0) {
				message = "Yes";
				break;
			} else if(s_list[i].compareTo(t_list[t_length - i - 1]) > 0) {
				break;
			}
		}
		if(i == s_length || i == t_length) {
			if(s_length < t_length) {
				message = "Yes";
			}
		}
		System.out.println(message);
	}
}