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.*;
class Main{
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		String s = in.next();
		String t = in.next();
		char[] S = new char[s.length()];
		char[] T = new char[t.length()];
		for(int i = 0; i < s.length(); i++)S[i] = s.charAt(i);
		for(int i = 0; i < t.length(); i++)T[i] = t.charAt(i);
		Arrays.sort(S);
		Arrays.sort(T);
		String sS = "";
		for(int i = 0; i < s.length(); i++)sS += S[i];
		String sT = "";
		for(int i = 0; i < t.length(); i++)sT += T[t.length()-i-1];
		if(sS.compareTo(sT)<0)System.out.println("Yes");
		else System.out.println("No");
	}
}