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.*;
import  java.lang.*;



class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String a = sc.nextLine();
        String b = sc.nextLine();

        List<Character> listA = new ArrayList<>();
        List<Character> listB = new ArrayList<>();

        for (int i = 0; i < a.length(); i++) {
            listA.add(a.charAt(i));
        }

        for (int i = 0; i < b.length(); i++) {
            listB.add(b.charAt(i));
        }

        Collections.sort(listA);
        Collections.sort(listB, Collections.reverseOrder());

        String aSorted = "";
        String bSorted = "";

        for (int i = 0; i < listA.size();i++) {
            aSorted += listA.get(i);
        }

        for (int i = 0; i < listB.size();i++) {
            bSorted += listB.get(i);
        }

        System.out.println(aSorted.compareTo(bSorted) < 0 ? "Yes" : "No");

    }
}