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

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		String s = sc.next();
		String t = sc.next();
		
		char[] sd = s.toCharArray();
		char[] items = t.toCharArray();

		Character[] td = new Character[items.length];
		
		for(int i=0, len=items.length; i<len; i++) {
			td[i] = Character.valueOf(items[i]);
		}
		
		Arrays.sort(sd);
		Arrays.sort(td, Collections.reverseOrder());
		
		s = String.valueOf(sd);
		
		for(int i=0, len=items.length; i<len; i++) {
			items[i] = td[i].charValue();
		}
		
		t = String.valueOf(items);
		
		
		if(s.compareTo(t) <= -1) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
		
		sc.close();
	}
}
