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.*;

public class Main {
	public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    String a = sc.next();
		String b = sc.next();

		char[] ac = a.toCharArray();
		char[] bc = b.toCharArray();

		Arrays.sort(ac);
		Arrays.sort(bc);
		for (int i = 0; i < b.length() / 2; i++) {
			char tmp = bc[i];
			bc[i] = bc[b.length() - 1 - i];
			 bc[b.length() - 1 - i] = tmp;
		}

		String aa = new String(ac);
		String bb = new String(bc);

		int al = aa.length();
		int bl = bb.length();
		if (aa.compareTo(bb) < 0) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
	}
}
