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 scanner =new Scanner(System.in);
		String oBefore = scanner.nextLine();
		String oBehind = scanner.nextLine();

		
		char[] before = oBefore.toCharArray();
		char[] behind = oBehind.toCharArray();
		
		Arrays.sort(before);
		Arrays.sort(behind);
		
		char[] reverse = new char[behind.length];
		for (int i = 0; i < reverse.length; i++) {
			reverse[reverse.length-i-1] = behind[i];			
		}
		
		String ans = "Yes";
		if (String.valueOf(before).compareToIgnoreCase(String.valueOf(reverse))>=0 ) {
			ans="No";
		}
		
		System.out.println(ans);
		scanner.close();
	}

}