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.util.*;
import static java.lang.Math.*;
import java.io.*;
public class S {
       
      public static void main(String args[])throws IOException{
              BufferedReader br = new  BufferedReader(new InputStreamReader(System.in));
             // int test = Integer.parseInt(br.readLine());
             // while(test > 0){
                   // test--;
                     StringTokenizer st = new StringTokenizer(br.readLine());
                     String f = st.nextToken();
                     String l = st.nextToken();
                     List<String> list = new ArrayList<String>();
                     for(int i = 0; i < f.length(); i++){
                        for(int j = 0; j < l.length(); j++){
                           String s = f.substring(0, i+1) + l.substring(0, j+1);
                           list.add(s);
                        }
                     }
                     Collections.sort(list);
                     System.out.println(list.get(0));
                  
                    //System.out.println(s + " " + tar);
                    //StringTokenizer st = new StringTokenizer(br.readLine());
                    //int n = Integer.parseInt(st.nextToken());
                    //int l = Integer.parseInt(st.nextToken());
                    //st = new StringTokenizer(br.readLine());
                    //int a[] = new int[n];
                    //for(int i = 0; i < n; i++){
                  //      a[i] = Integer.parseInt(st.nextToken());
                    //}
            // }
      }
      
      public static void solve(int n, int a[][], Map<Integer, List<Integer>> g){
           
      }
      public static int gcd(int a, int b){
            if(b == 0)return a;
            return gcd(b, a%b);
      }
}