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

class Main{
	static Scanner s=new Scanner(System.in);
	static int gInt(){return Integer.parseInt(s.next());}

	public static void main(String[]$){
		String a=get(),b=get();
		b=reverse(b);
		System.out.println(a.compareTo(b)<0?"Yes":"No");
	}
	private static String reverse(String b){
		StringBuilder sb=new StringBuilder();
		for(int i=b.length()-1;i>=0;--i)
			sb.append(b.charAt(i));
		return sb.toString();
	}

	static String get(){
		StringBuilder sb=new StringBuilder();
		s.next().chars().sorted().forEach(i->sb.append((char)i));
		return sb.toString();
	}
}