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

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

		char[] cs = s.toCharArray();
		char[] ct = t.toCharArray();

		Arrays.sort(cs);
		Arrays.sort(ct);

		StringBuilder sbt = new StringBuilder();
		StringBuilder sbs = new StringBuilder();

		for (int i = 0; i < t.length(); i++) {
			sbt = sbt.append(ct[t.length() - 1 - i]);
		}
		for (int i = 0; i < s.length(); i++) {
			sbs = sbs.append(cs[i]);
		}

		String[] str = new String[2];
		str[0] = sbs.toString();
		str[1] = sbt.toString();

		Arrays.sort(str);

		String ans = "";
		if (sbs.toString().equals(sbt.toString())) {
			ans = "No";
		} else if (str[0].equals(sbs.toString())) {
			ans = "Yes";
		} else {
			ans = "No";
		}

		System.out.println(ans);
	}

}
