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.*;

class Main {
    public static void main(String[] args) {
        new Solver().run();
    }
}

class Solver {

    private String minimize(String s) {
        String buf = new String(s);
        char[] a = buf.toString().toCharArray();
        Arrays.sort(a);
        return new String(a);
    }

    private String maximize(String s) {
        String buf1 = new String(s);
        char[] a = buf1.toString().toCharArray();
        Arrays.sort(a);
        return new StringBuilder(new String(a)).reverse().toString();
    }

    public void run() {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        String t = sc.next();

        String sd = minimize(s);
        String td = maximize(t);

        int ret = sd.compareTo(td);
        if (ret < 0) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        return;
    }

}