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.Collections;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		String output = "No";

		Scanner scanner = new Scanner(System.in);

		String s = scanner.nextLine();
		String t = scanner.nextLine();

		char[] sChar = s.toCharArray();
		char[] tChar = t.toCharArray();

		Character[] td = new Character[tChar.length];

		for(int i = 0,len = tChar.length;i<len;i++) {
			td[i]= Character.valueOf(tChar[i]);
		}

		Arrays.sort(sChar);
		Arrays.sort(td, Collections.reverseOrder());

		s = String.valueOf(sChar);

		for(int i = 0,len = tChar.length;i<len;i++) {
			tChar[i]= td[i].charValue();
		}

		t = String.valueOf(tChar);


		if(s.compareTo(t) <= -1)
			output ="Yes";

		System.out.println(output);

		scanner.close();
	}

}