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 S = sc.next();
		String T = sc.next();
		sc.close();
		char[] ch1 = S.toCharArray();
		char[] ch2 = T.toCharArray();
		List<Character> list1 = new ArrayList<>();
		List<Character> list2 = new ArrayList<>();
		for(int i = 0;i < ch1.length;i++) {
			list1.add(ch1[i]);
		}
		for(int i = 0;i < ch2.length;i++) {
			list2.add(ch2[i]);
		}
		Collections.sort(list1);
		Collections.sort(list2,Comparator.reverseOrder());
		String S2 = "";
		String T2 = "";
		for(int i = 0;i < list1.size();i++) {
			S2 += list1.get(i);
		}
		for(int i = 0;i < list2.size();i++) {
			T2 += list2.get(i);
		}
		if(S2.compareTo(T2) < 0) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	}
}