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

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		String t = sc.next();
		sc.close();
		
		char[] sElem = new char[s.length()];
		for(int i = 0;i < s.length();++i)
			sElem[i] = s.charAt(i);
		char[] tElem = new char[t.length()];
		for(int i = 0;i < t.length();++i)
			tElem[i] = t.charAt(i);
		Arrays.sort(sElem);
		Arrays.sort(tElem);
		
		boolean flag = true;
		for(int i = 0;i < s.length();++i) {
			if(sElem[i] < tElem[t.length()-1-i]) {
				flag = true;
				break;
			} else if(sElem[i] > tElem[t.length()-1-i]) {
				flag = false;
				break;
			} else if(i == t.length()-1) {
				flag = false;
				break;
			}
		}
		if(flag)
			System.out.println("Yes");
		else
			System.out.println("No");
	}
}
