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

public class Test8
{
public static void main(String[] args)
{
    Scanner sc = new Scanner(System.in);
    String[] name = sc.nextLine().split(" ");
    StringBuilder sb = new StringBuilder();
    int maxsize = (name[0].length() + name[1].length()); 
    int findex = 0;
    sb.append((char)name[0].charAt(findex++));
    int lindex = 0;
    for (int i = 0; i < maxsize; i++)
        {
            if (findex < name[0].length() && lindex < name[1].length())
            {
                sb.append((char) (Math.min(name[0].charAt(findex), name[1].charAt(lindex))));
                if (name[0].charAt(findex) == name[1].charAt(lindex))
                {
                    findex++;lindex++;
                }
                else if (name[0].charAt(findex) <= name[1].charAt(lindex))
                    findex++;
                else
                    lindex++;
            }
            else if (findex >= name[0].length())
            {
                sb.append((char) (name[1].charAt(lindex)));
                lindex++;
            }
            else if (lindex >= name[1].length())
            {
                sb.append((char) (name[0].charAt(findex)));
                findex++;
            }
            
            if (findex > 0 && lindex > 0)
                break;
        }
    
    System.out.println(sb.toString());
}
}