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

public class lolqop {

	public static void main(String args[])
	{
		ArrayList<String> ar=new ArrayList<String>();
		
		Scanner scan=new Scanner(System.in);
		String f=scan.next();
		String s=scan.next();
		//System.out.println(f+" "+s);
		//System.out.println(f.substring(0,1)+s.substring(0,1));
		for(int i=1;i<=f.length();i++)
		{
			//form prefix
			String p=f.substring(0,i);
			//System.out.println(p);
			
			for(int j=1;j<=s.length();j++)
			{
				String ps=s.substring(0,j);
				String g=p+ps;
				//System.out.println(i+" "+g+" times "+ps);
				
				ar.add((g));
			}
			
		}
		Collections.sort(ar);
		System.out.println(ar.get(0));
		for(String x:ar)
		{
			//System.out.println(x);
		}
	}
}
