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.ArrayList;
import java.util.Scanner;

public class Main {
    public static void main(String[]args){
        Scanner scanner = new Scanner(System.in);
        String firstName;
        String lastName;
        ArrayList<String>logins = new ArrayList<>();
        firstName = scanner.next();
        lastName = scanner.next();
        for(int i=0;i<firstName.length();i++){
            for(int j=0;j<lastName.length();j++){
                String login = firstName.substring(0,i+1) + lastName.substring(0,j+1);
                logins.add(login);
            }
        }
        String login = logins.get(0);
        for(int i=1;i<logins.size();i++){
            if(firstLower(logins.get(i),login)){
                login = logins.get(i);
            }
        }
        System.out.println(login);
    }

    private static boolean firstLower(String s1, String s2){
        int i=0;
        while(true){
            if(s1.charAt(i) < s2.charAt(i)){
                return true;
            }
            else if(s2.charAt(i) < s1.charAt(i)){
                return false;
            }
            i++;
            if(s1.length() == i || s2.length() == i){
                return s1.length() < s2.length();
            }
        }
    }
}