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[] args) {
		Scanner scan = new Scanner(System.in);
		String s=scan.next();
		String t=scan.next();
		scan.close();
		char sc[] = s.toCharArray();
		char st[] = t.toCharArray();

		Arrays.sort(sc);
		Arrays.sort(st);
		int min=Math.min(st.length, sc.length);
		int check=0;
		int cnt=0;
		for(int i=0;i<min;i++) {

			if(sc[i] < st[st.length-1-i]) {
				check=1;
				break;
			}
			if(sc[i] == st[st.length-1-i])cnt++;
			if(cnt==min)check=-1;
		}
		if(check==-1) {
			if(sc.length < st.length)check=1;
			else check=0;
		}

		System.out.println((check==1)? "Yes":"No");
	}

}