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.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

class Main {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		String t = sc.next();
		
		char[] c1 = s.toCharArray();
		Arrays.sort(c1);
		
		char[] c2 = t.toCharArray();
		Arrays.sort(c2);
		
		int n = Math.min(c1.length, c2.length);
		String ans = "Yes";
		for (int i = 0; i < n; i++) {
			if (c1[i] > c2[c2.length - 1 - i]) {
				ans = "No";
				break;
			}
			
			if (c1[i] == c2[c2.length - 1 - i]) {
				if (i == n - 1 && c1.length >= c2.length) {
					ans = "No";
				}
				continue;
			}
			if (c1[i] < c2[c2.length - 1 - i]) break;
		}
		
		
		
		System.out.println(ans);
		
	}
}