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 a implements Runnable{
	int N;
	int[] arr;
	public static void main(String[] args) { new Thread(null, new a(), "", 1<<27).start(); } public void run() {
		String firstName = nextString();
		String lastName = nextString();
		ArrayList<String> strings = new ArrayList<>();
		for(int i = 0; i < firstName.length(); i++) {
			for(int j = 0; j < lastName.length(); j++) {
				strings.add(firstName.substring(0,i+1).concat(lastName.substring(0,j+1)));
			}
		}
		Collections.sort(strings);
		System.out.println(strings.get(0));
	}
	

	// fast scanner stuff
	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	String[] line = null; int line_ptr = 0;
	void read() {
		try {
			line = br.readLine().split(" ");
		}
		catch(IOException ioe) {
			System.err.println("bad input");
			line = null;
		}
	}
	void ensure() {
		while(line == null || line.length <= line_ptr) {
			read();
		}
	}
	int nextInt() {
		ensure();
		return Integer.parseInt(line[line_ptr++]);
	}
	long nextLong() {
		ensure();
		return Integer.parseInt(line[line_ptr++]);
	}
	String nextString() {
		ensure();
		return line[line_ptr++];
	}
}