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();

		List<String> sArray = new ArrayList<String>();
		for (int i = 0; i < s.length(); i++) {
			sArray.add(s.substring(i, i + 1));
		}
		Collections.sort(sArray);
		String cs = "";
		for (String string : sArray) {
			cs = cs + string;
		}
		List<String> tArray = new ArrayList<String>();
		for (int i = 0; i < t.length(); i++) {
			tArray.add(t.substring(i, i + 1));
		}
		Collections.sort(tArray);
		String ct = "";
		for (String string : tArray) {
			ct = string + ct;
		}

		if (cs.compareTo(ct) < 0) {
			System.out.println("Yes");

		} else {
			System.out.println("No");

		}

	}
}