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.*;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
      	String s = sc.next();
        String t = sc.next();
      	char ss[] = s.toCharArray();
    	char ts[] = t.toCharArray();
      	char trs[] = new char[t.length()];
      
      	Arrays.sort(ss);
      	Arrays.sort(ts);
      	
      	for(int i = 0;i < t.length();i++) trs[i] = ts[t.length()-1-i];
      
      	s = new String(ss);
      	t = new String(trs);
          
      	if(s.compareTo(t) < 0) System.out.println("Yes");
      	else System.out.println("No");
      
	}
}