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.*;
import java.io.*;

public class GenerateLogin {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer t = new StringTokenizer(in.readLine());
		String first = t.nextToken();
		String last = t.nextToken();
		String ans = "zzzzzzzzzzzzzzzzzzzzz";
		for(int i = 0; i < first.length(); ++i) {
			for(int j = 0; j < last.length(); ++j) {
				StringBuilder pass = new StringBuilder();
				for(int k = 0; k <= i; ++k)
					pass.append(first.charAt(k));
				for(int k = 0; k <= j; ++k)
					pass.append(last.charAt(k));
				if(lower(pass.toString(), ans))
					ans = pass.toString();
			}
		}
		System.out.println(ans);
	}
	public static boolean lower(String one, String two) {
		for(int i = 0; i < Math.min(one.length(), two.length()); ++i) {
			if(one.charAt(i) < two.charAt(i))
				return true;
			else if(two.charAt(i) < one.charAt(i))
				return false;
		}
		return one.length() < two.length();
	}
}
