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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        String [] s = in.next().split("");
        String [] t = in.next().split("");
        Arrays.sort(s);
        Arrays.sort(t);
        String new_s = "";
        for (int i = 0; i < s.length; i++){
            new_s += s[i];
        }
        String new_t = "";
        for (int i = t.length-1; i >= 0; i--){
            new_t += t[i];
        }
        if (new_s.equals(new_t)){
            System.out.println("No");
            return;
        }
        String [] sort = {new_s, new_t};
        Arrays.sort(sort);
        if (sort[0].equals(new_s)){
            System.out.println("Yes");
            return;
        }
        System.out.println("No");
    }
}