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 Solution {
	
	public static boolean comp(String a,String b){
		for(int i=0;i<Math.min(a.length(),b.length());i++){
			if(a.charAt(i)<b.charAt(i)){
				return true; 
			}else if(a.charAt(i)>b.charAt(i)){
				return false;
			}
		}
		if(a.length()<=b.length()){
			return true;
		}else{
			return false;
		}
	}
	
	public static void main(String[] args) {
		// Write your code here
      Scanner s=new Scanner(System.in);
	  String a=s.next(),b=s.next();
	//  System.out.println(a+" "+b);
	  String[] str=new String[101];		
      int k=0;
	  for(int i=1;i<=a.length();i++){
		  for(int j=1;j<=b.length();j++){
			  str[k]=new String();
			  str[k++]=a.substring(0,i)+b.substring(0,j);
		  }
	  }
	  for(int i=0;i<k;i++){
		  for(int j=i+1;j<k;j++){
			  if(comp(str[i],str[j])){
				  continue;
			  }else{
				  String temp=str[i];
				  str[i]=str[j];
				  str[j]=temp;
			  }
		  }
	  }
	  System.out.println(str[0]);
	}
}