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

			char[] s = sc.next().toCharArray();
			String T = sc.next();
			
			Character[] t = new Character[T.length()];
			
			for(int i=0;i<T.length();i++) {
				t[i] = T.charAt(i);
			}
			
			Arrays.sort(s);
			Arrays.sort(t,Collections.reverseOrder());
			
			char[] tn = new char[T.length()];
			
			for(int i =0;i<T.length();i++) {
				tn[i] = t[i];
			}
			
						
			String Sn = String.valueOf(s);
			String Tn = String.valueOf(tn);
			

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



	}
