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[]srgs) {
	Scanner scan=new Scanner(System.in);
	String a=scan.next();
	String b=scan.next();
	char c[]=new char[a.length()];
	char d[]=new char[b.length()];
	char e[]=new char[b.length()];
	for(int i=0;i!=a.length();i++) {
		c[i]=a.charAt(i);
	}
	for(int i=0;i!=b.length();i++) {
		d[i]=b.charAt(i);
	}
	Arrays.sort(c);
	Arrays.sort(d);
	for(int i=0;i!=b.length();i++) {
		e[i]=d[b.length()-i-1];
	}
	String A="";
	String B="";
	for(int i=0;i!=a.length();i++) {
		A=A+c[i];
	}
	for(int i=0;i!=b.length();i++) {
		B=B+e[i];
	}
	
	System.out.println(A.compareTo(B)<=-1?"Yes":"No");
}
}