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

public class Solution {

    public static void main(String[] args) throws IOException {
       BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        
        String[] input = br.readLine().split(" ");
        String s1 = input[0];
        String s2 = input[1];
        
        int l1 = s1.length();
        int l2 = s2.length();
        String ans = "";
        for(int i = 0; i < l2; i++) {
            String sub2 = s2.substring(0, i + 1);
            for(int j = 0; j < l1; j++) {
                String sub1 = s1.substring(0, j + 1);
                String newString = sub1 + sub2;
                if(ans.equals("") == true) {
                    ans = newString;
                } else {
                    int len1 = ans.length();
                    int len2 = newString.length();
                    int len = 0;
                    while(len < len1 && len < len2) {
                        if(ans.charAt(len) > newString.charAt(len)) {
                            ans = newString;
                            break;
                        } else if(ans.charAt(len) < newString.charAt(len)) {
                            break;
                        }
                        len++;
                    }
                    
                    if(len == len2) {
                        ans = newString;
                    }
                }
            }
        }
        
        System.out.print(ans);
    }
}