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().split("");
        Arrays.sort(s, Comparator.naturalOrder());
        String sortedS;
        String sortedT;
        StringBuilder builder = new StringBuilder();
        for(String value : s) {
          builder.append(value);
        }
        sortedS = builder.toString();
        builder.setLength(0);
        String[] t = sc.next().split("");
        Arrays.sort(t, Comparator.reverseOrder());
        for(String value : t) {
          builder.append(value);
        }
        sortedT = builder.toString();

        String[] list = {sortedS, sortedT};
        Arrays.sort(list, Comparator.naturalOrder());
    
		// 出力
		System.out.println(!sortedS.equals(sortedT) && list[0].equals(sortedS) ? "Yes" : "No");
	}
}