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.File;
import java.io.IOException;
import java.util.*;

import javax.swing.plaf.synth.SynthSeparatorUI;
 
public class Main {
 
	public static void main(String[] args) throws IOException {
		//File file = new File("input.txt");
		//Scanner sc = new Scanner(file);
		
		Scanner sc = new Scanner(System.in);
		
		String s = sc.next();
		String t = sc.next();
		char[] ss = s.toCharArray();
		Arrays.sort(ss);
		char[] tt = t.toCharArray();
		Arrays.sort(tt);
		
		int lenS = s.length();
		int lenT = t.length();
		int len = lenS;
		if(lenS > lenT) len = lenT;
		
		for(int i = 0; i < len; i++){
			if(ss[i] < tt[lenT-i-1]){
				System.out.println("Yes");
				return;
			}
			if(ss[i] > tt[lenT-i-1]){
				System.out.println("No");
				return;
			}
		}
		
		System.out.println((lenS < lenT) ? "Yes" : "No");
	}
}