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 sc = new Scanner(System.in);
	String s1 = sc.next();
	String s2 = sc.next();

	char[] c1 = s1.toCharArray();
	char[] c2 = s2.toCharArray();

	Arrays.sort(c1);
	Arrays.sort(c2);

	char ch1, ch2;
	int max = Math.min(c1.length, c2.length);
	for(int i = 0; i<max; i++) {
	    ch1 = c1[i];
	    ch2 = c2[c2.length-1-i];
	    if(ch1<ch2) {
		System.out.println("Yes");
		return;
	    }
	    if(ch1>ch2) {
		System.out.println("No");
		return;
	    }
	}
	if(c1.length<c2.length) {
	    System.out.println("Yes");
	}else {
	    System.out.println("No");
	}



    }
}