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.Comparator;
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 a = s.length();
		int b = t.length();
		char[] cs = new char[s.length()];
		for (int i = 0; i < s.length(); i++) {
			cs[i] = s.charAt(i);
		}
		Character[] ct = new Character[t.length()];
		for (int i = 0; i < t.length(); i++) {
			ct[i] = t.charAt(i);
		}
		Arrays.sort(cs);
		Arrays.sort(ct, Comparator.reverseOrder());
		boolean f = true;
		boolean same = true;
		for (int i = 0; i < Math.min(a, b); i++) {
			if (cs[i] > ct[i]) {
				f = false;
				same = false;
				break;
			}
			if (cs[i] < ct[i]) {
				same = false;
				break;
			}
		}
		if (same == true && a>=b) {
			f = false;
		}
		if (f) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
	}
}
