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<string.h>

int main(){
  
  char s[100],t[100];
  char temp;
  scanf("%s %s",s,t);

  int len_s,len_t;
  len_s = strlen(s);
  len_t = strlen(t);
  int count = 0;
  
  if(len_s > len_t){
    count = len_s;
  }else{
    count = len_t;
  }

//  printf("%d %d",len_s,len_t);

  for(int i=1; i<len_s; i++){
    for(int j=1; j<len_s; j++){
      if(s[j-1] > s[j]){
        temp = s[j-1];
        s[j-1] = s[j];
        s[j] = temp;
      }
    }
  }

  for(int i=1; i<len_t; i++){
    for(int j=1; j<len_t; j++){
      if(t[j-1] < t[j]){
        temp = t[j-1];
        t[j-1] = t[j];
        t[j] = temp;
      }
    }
  }

//  printf("%s\n%s\n",s,t);

  for(int i=0; i<count; i++){
    if(s[i] == '\0'){
      printf("Yes");
      return 0;
    }else if(t[i] == '\0'){
      printf("No");
      return 0;
    }

    if(s[i] < t[i]){
      printf("Yes");
      return 0;
    }else if(s[i] > t[i]){
      printf("No");
      return 0;
    }
  }

  printf("No");

}