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.math.BigDecimal;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		String s = sc.nextLine();
		String t = sc.nextLine();
		String S = "";
		String T = "";
		char[] chars = new char[s.length()]; 
		char[] chart = new char[t.length()]; 
		for (int i = 0; i < s.length(); i++) chars[i] = s.charAt(i);
		for (int i = 0; i < t.length(); i++) chart[i] = t.charAt(i);

		Arrays.sort(chars);
		Arrays.sort(chart);
		
		for (int i = 0; i < s.length(); i++) S += chars[i];
		for (int i = 0; i < t.length(); i++) T += chart[t.length() - i - 1];
		String ans = "No";
		if (S.compareTo(T) < 0) ans = "Yes"; 
		
		System.out.println(ans);
	}

}
