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.lang.reflect.Array;
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[] charS = s.toCharArray();
        Arrays.sort(charS);
        char[] charT = t.toCharArray();
        Arrays.sort(charT);

        String s2 = "";
        for (char c : charS) {
            s2 += c;
        }
        String t2 = "";
        for (char c : charT) {
            t2 = c + t2;
        }

        String[] array = new String[] { s2, t2 };
        Arrays.sort(array);

        boolean judge = s2.equals(array[0]);
        String result = judge && !s.equals(t) ? "Yes" : "No";

        // 出力
        System.out.println(result);
        sc.close();
    }
}
