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

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int s[] = new int[26];
		int t[] = new int[26];
		String S = sc.next();
		String T = sc.next();
		for (int i=0;i<S.length();i++) {
			s[S.charAt(i)-'a']++;
		}
		for (int i=0;i<T.length();i++) {
			t[T.charAt(i)-'a']++;
		}
		int i = 0;
		for (;i<26;i++) {
			if (s[i]>0) {
				break;
			}
		}
		int j =25;
		for (;j>=0;j--) {
			if (t[j]>0) {
				break;
			}
		}
		if (j>i) {
			System.out.println("Yes");
		} else if (j==i){
			if (s[i]==S.length()) {
				if (s[i]<t[j]) {
					System.out.println("Yes");
				} else if (s[i]==t[j]&&S.length()<T.length()) {
					System.out.println("Yes");
				} else {
					System.out.println("No");
				}
			} else {
				System.out.println("No");
			}
		} else {
			System.out.println("No");
		}
	}
}