Problem:
Score : 200 points

Problem Statement

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.

Notes

For a string a = a_1 a_2 ... a_N of length N and a string b = b_1 b_2 ... b_M of length M, we say a < b for the lexicographic order if either one of the following two conditions holds true:

N < M and a_1 = b_1, a_2 = b_2, ..., a_N = b_N.

There exists i (1 \leq i \leq N, M) such that a_1 = b_1, a_2 = b_2, ..., a_{i - 1} = b_{i - 1} and a_i < b_i. Here, letters are compared using alphabetical order.

For example, xy < xya and atcoder < atlas.

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.

Sample Input 1

yx
axy

Sample Output 1

Yes

We can, for example, rearrange yx into xy and axy into yxa. Then, xy < yxa.

Sample Input 2

ratcode
atlas

Sample Output 2

Yes

We can, for example, rearrange ratcode into acdeort and atlas into tslaa. Then, acdeort < tslaa.

Sample Input 3

cd
abc

Sample Output 3

No

No matter how we rearrange cd and abc, we cannot achieve our objective.

Sample Input 4

w
ww

Sample Output 4

Yes

Sample Input 5

zzz
zzz

Sample Output 5

No

Solution in C (GCC 5.4.1) (judge verdict: Accepted)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define MAX(a,b) (a > b ? a : b)
#define MIN(a,b) (a < b ? a : b)
const int inf = 1000000000; // 10^9
int com_desc_str(const void* a,const void* b){
   char *x=(char*)a,*y=(char*)b;
   return strcmp(y,x);
} 
int com_dic_str(const void* a,const void* b){
   char *x=(char*)a,*y=(char*)b;
   return strcmp(x,y);
} 
int main(){
   char s[101],t[101];scanf("%s %s",s,t);
   qsort(t,strlen(t),sizeof(char),com_desc_str);
   qsort(s,strlen(s),sizeof(char),com_dic_str);
   //printf("%s %s\n",s,t);
   if(strcmp(s,t)<0)printf("Yes");
   else printf("No");
   /*for(int i = 0;i < MAX(strlen(s),strlen(t));i++){
      if(s[i]<t[i]){
         printf("Yes");
         return 0;
      }else if(s[i]>t[i]){
         printf("No");
         return 0;
      }
      if(i >= strlen(s)&&strlen(s)<strlen(t)){
         printf("Yes");
         return 0;
      }
   }*/
}