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

public class A {

	public static void main(String[] args) throws NumberFormatException, IOException {
		// TODO Auto-generated method stub
		BufferedReader b=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer tk = new StringTokenizer(b.readLine());
		String first=tk.nextToken();
		String sec=tk.nextToken();
		String s=""+first.charAt(0)+sec.charAt(0);
//		System.out.println(s+" "+s.length());
		for(int i=1;i<first.length();i++){
			if(first.charAt(i)<s.charAt(i)){
				s=s.substring(0, i)+first.charAt(i)+s.substring(i);
			}else{
				break;
			}
		}System.out.println(s);
		
		
//		while(t-->0){
//			int[] A=new int[4];
//			int n=Integer.parseInt(b.readLine());
//			StringTokenizer tk = new StringTokenizer(b.readLine());
//			long res=0;
//			while(n-->0){
//				int k=Integer.parseInt(tk.nextToken());
//				res+=k;
//				A[k%4]+=1;
//			}
//			if((res%4)!=0){
//				System.out.println("-1");
//				continue;
//			}
//			int sum=0;
//			int q=Math.min(A[1], A[3]);
//			A[1]-=q;
//			A[3]-=q;
//			sum+=q;
//			int c=(A[1]/2);
//			A[1]=A[1]%2;
//			A[2]+=c;
//			sum+=c;
//			int a1=A[2]/2;
//			A[2]=A[2]%2;
//			sum+=a1;
////			int c=Math.min(A[1]/2, A[2]);
//			sum+=3*(A[3]/4);
//			A[3]=A[3]%4;
//			if(A[3]%2==0){
//				sum+=(2*A[2]);
//			}
//			System.out.println(sum);
//			}
		}
	}

