The preferred way to generate user login in Polygon is to concatenate a prefix of the user's first name and a prefix of their last name, in that order. Each prefix must be non-empty, and any of the prefixes can be the full name. Typically there are multiple possible logins for each person.

You are given the first and the last name of a user. Return the alphabetically earliest login they can get (regardless of other potential Polygon users).

As a reminder, a prefix of a string s is its substring which occurs at the beginning of s: "a", "ab", "abc" etc. are prefixes of string "{abcdef}" but "b" and 'bc" are not. A string a is alphabetically earlier than a string b, if a is a prefix of b, or a and b coincide up to some position, and then a has a letter that is alphabetically earlier than the corresponding letter in b: "a" and "ab" are alphabetically earlier than "ac" but "b" and "ba" are alphabetically later than "ac".

Input

The input consists of a single line containing two space-separated strings: the first and the last names. Each character of each string is a lowercase English letter. The length of each string is between 1 and 10, inclusive. 

Output

Output a single string — alphabetically earliest possible login formed from these names. The output should be given in lowercase as well.

Examples

Input

harry potter


Output

hap


Input

tom riddle


Output

tomr

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author Lotfi
 */
public class decryptage {
public static void main(String[] arg) throws IOException{
    IO sc= new IO(System.in);
    String s1=sc.next();
    String s2=sc.next();
    char a=s1.charAt(0);
    char b=s2.charAt(0);
   String ans=a+"";
    for (int i = 1; i <s1.length() ; i++) {
        if((char)b>(char)s1.charAt(i)){
            ans+=s1.charAt(i);
        }
        else
            break;
    }
    ans+=b;
    System.out.println(ans);
 }
    




         
        
    
 


public  static class IO {
  private BufferedReader br;
  private StringTokenizer st;
  public IO(InputStream inputStream){
    br = new BufferedReader(new InputStreamReader(inputStream));
  }
  public String nextLine() throws IOException{
      return br.readLine();
  }
  public String next() {
    while (st == null || !st.hasMoreTokens()){
      try {
        st = new StringTokenizer(br.readLine());
      } catch (IOException ignored){}
    }
    return st.nextToken();
  }
  public int nextInt() {
    return Integer.parseInt(next());
  }
  public long nextLong() {
    return Long.parseLong(next());
  }
 
}
}
