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
#include <bits/stdc++.h>
const bool DEBUG = false;
using namespace std;
const long long maxn = 50000 + 5 + 1;
const long long INF = 4e18;
const long long M = 1e9 + 7;
const int lg = 21;
string s1, s2, k1, k2;
vector<string> v;
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> s1 >> s2;
  int zs1 = s1.size();
  int zs2 = s2.size();
  for (int i = 0; i < zs1; i++) {
    k1.push_back(s1[i]);
    k2.clear();
    for (int j = 0; j < zs2; j++) {
      k2.push_back(s2[j]);
      v.push_back(k1 + k2);
    }
  }
  sort(v.begin(), v.end());
  cout << v[0] << endl;
  return 0;
}
