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.*;
import static java.lang.Math.*;
import java.math.BigInteger;

public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		// 入力
		String s = sc.next();
		String t = sc.next();
		
		// 計算
		String result = "No";
		char[] ss = s.toCharArray();
		Arrays.sort(ss);
		String s2 = String.valueOf(ss);
		char[] temp = t.toCharArray();
		Arrays.sort(temp);
		char[] tt = new char[temp.length];
		for(int i = 0; i < tt.length; i++){
		    tt[i] = temp[tt.length - 1 - i];
		}
		String t2 = String.valueOf(tt);
		if(s2.compareTo(t2) < 0) result = "Yes";
		
		// 出力
		System.out.println(result);
	}
}

