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.awt.Point;
import java.util.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.*;
import java.util.*;

public class Main {
	//////
	static class FastReader {
		BufferedReader br;
		StringTokenizer st;

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}

	//////
	public static long modularExponentiation(long x,long n,long M)
	{
	    long result=1;
	    while(n>0)
	    {
	        if(n % 2 ==1)
	            result=(result * x)%M;
	        x=(x*x)%M;
	        n=n/2;
	    }
	    return result;
	}

	/////
	static long d(int x,int y){
		if(Math.abs(x-y)>1){
			return y-x;
		}else
			return 0;
		
	} 
	
	static int closestSquare(int num){
		
		if(num==0){
			return -1;
		}
		int root=(int)Math.sqrt(num);
		int another=root+1;
		root=root*root;
		another=another*another;
		if(another-num>num-root){
			return num-root;
		}else
			return another-num;
		
	}
	
	public static void main(String[] args) throws IOException {

		FastReader scan = new FastReader();
		PrintWriter pw=new PrintWriter(System.out);
	
		String A=scan.next();
		String B=scan.next();
		String[] ans=new String[A.length()];
		Arrays.fill(ans,"");
		int j=0;
		for(int i=0;i<ans.length;i++){
			int num=j;;
			num++;
			for(int k=0;k<num;k++){
			ans[i]+=A.charAt(k);
			}
			ans[i]+=B.charAt(0);
			j++;
		}
		
		Arrays.sort(ans);
		//System.out.println(Arrays.toString(ans));
		System.out.println(ans[0]);
		
	}
}
