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


public class C455A {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		String[] dir = sc.nextLine().split(" ");
		String first = dir[0];
		String last = dir[1];
		
		String letters = "abcdefghijklmnopqrstuvwxyz";
		
		String ans = first.substring(0, 1) + last.substring(0, 1);
		
		for(int x=0; x<first.length(); x++){
			for(int y=0; y<last.length(); y++){
				String poss = first.substring(0, x+1) + last.substring(0, y+1);
				//System.out.println(poss.compareTo(ans));
				if(poss.compareTo(ans) < 0){
					ans = poss;
				}
			}
		}
		
		
		
		
		System.out.println(ans);
	}
	
	static int p(String s){
		String letters = "abcdefghijklmnopqrstuvwxyz";
		return letters.indexOf(s);
	}
}


/*
int n = Integer.parseInt(sc.nextLine());
String[] t = sc.nextLine().split(" ");
int[] list = new int[n];
for(int x=0; x<n; x++){
	list[x] = Integer.parseInt(t[x]);
}
		
String[] dir = sc.nextLine().split(" ");
int a = Integer.parseInt(dir[0]);
int b = Integer.parseInt(dir[1]);
int c = Integer.parseInt(dir[2]);
int d = Integer.parseInt(dir[3]);
int e = Integer.parseInt(dir[4]);

int n = Integer.parseInt(sc.nextLine());
*/