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) {

		Scanner scan = new Scanner(System.in);
		String s = scan.next();
		String t = scan.next();
		
		char[] list1 = s.toCharArray();
		Arrays.sort(list1);
		s = String.valueOf(list1);
		
		char[] list2 = t.toCharArray();
		Arrays.sort(list2);
		t = String.valueOf(list2);
		
		t = new StringBuilder(t).reverse().toString();

		if (s.compareTo(t) < 0) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
		
		
	}
}
