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.Collections;
import java.util.List;
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();
		List<String> sl = Arrays.asList(s.split(""));
		List<String> tl = Arrays.asList(t.split(""));
		Collections.sort(sl);
		Collections.sort(tl);
		Collections.reverse(tl);
		boolean able = false;
		for (int i = 0; i < ((sl.size() <= tl.size())? sl.size() : tl.size()); i++) {
			if (sl.get(i).compareTo(tl.get(i)) < 0) {
				able =true;
				break;
			}
			else if (sl.get(i).compareTo(tl.get(i)) > 0) {
				break;
			}
			else if (sl.size() < tl.size() && i == sl.size() - 1) {
				able = true;
			}
		}
		System.out.println((able)? "Yes" : "No");
	}
}