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();
		String sDash = "";
		String tDash = "";

		char[] sChar = s.toCharArray();
		Arrays.sort(sChar);
		char[] tChar = t.toCharArray();
		Arrays.sort(tChar);

		s = new String(sChar);
		t = new String(tChar);

		StringBuffer sb = new StringBuffer(t);
		t = sb.reverse().toString();

		boolean flag = true;
		for (int i = 0; i < Math.min(s.length(), t.length()); i++) {
			if (s.charAt(i) != t.charAt(i)) flag = false;
			if (s.charAt(i) < t.charAt(i)) {
				System.out.println("Yes");
				System.exit(0);
			}
		}

		if (flag && s.length() < t.length()) System.out.println("Yes");
		else System.out.println("No");
 	}
}