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.*;
// warm-up
public class Main {

	static void solve() {
		Scanner sc = new Scanner(System.in);
		int[] c = new int[256];
		boolean ok = true;
		String a = sc.next(), b = sc.next();
		for (char ch : b.toCharArray()) c[ch]++;
		for (char ch : a.toCharArray()) {
			if (c[ch]>0) c[ch]--;
			else ok=false;
		}
		if (ok) ok = a.length()<b.length();
		if (!ok) {
			StringBuilder f = new StringBuilder();
			StringBuilder g = new StringBuilder();
			char[] d = a.toCharArray(), e = b.toCharArray();
			Arrays.sort(d); Arrays.sort(e);
			for (char ch : d) f.append(ch);
			for (char ch : e) g.append(ch);
			ok=f.compareTo(g.reverse())<0;
		}
		System.out.println(ok ? "Yes" : "No");
		sc.close();		
	}

	public static void main(String args[]) {
		solve();
	}

}