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.*;

public class Code {
    public static void main(String[] args) {
        // Use the Scanner class
        Scanner sc = new Scanner(System.in);
        /*
         * int n = sc.nextInt(); // read input as integer long k =
         * sc.nextLong(); // read input as long double d = sc.nextDouble(); //
         * read input as double String str = sc.next(); // read input as String
         * String s = sc.nextLine(); // read whole line as String
         */

        String i = sc.nextLine();
        System.out.println(f(i));
    }

    public static String f(String s) {
        String[] parts = s.split(" ");
        String f = parts[0];
        String l = parts[1];


        char cur = f.charAt(0);
        String result = "" + cur;
        for (int i = 1; i < f.length(); ++i) {
            if (f.charAt(i) < l.charAt(0)) {
                cur = f.charAt(i);
                result = f.substring(0, i+1);
            } else {
                break;
            }
        }
        result += l.charAt(0);
        return result;
    }


}