#include <bits/stdc++.h>
using namespace std;
void file() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
void _print(long long t) { cerr << t; }
void _print(int t) { cerr << t; }
void _print(string t) { cerr << t; }
void _print(char t) { cerr << t; }
void _print(long double t) { cerr << t; }
void _print(double t) { cerr << t; }
void _print(unsigned long long t) { cerr << t; }
template <class T, class V>
void _print(pair<T, V> p);
template <class T>
void _print(vector<T> v);
template <class T>
void _print(set<T> v);
template <class T>
void _print(set<T, greater<int>> v);
template <class T, class V>
void _print(map<T, V> v);
template <class T>
void _print(multiset<T> v);
template <class T, class V>
void _print(pair<T, V> p) {
  cerr << "{";
  _print(p.first);
  cerr << ",";
  _print(p.second);
  cerr << "}";
}
template <class T>
void _print(vector<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(set<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(set<T, greater<int>> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(multiset<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T, class V>
void _print(map<T, V> v) {
  cerr << "[ ";
  for (auto i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
void solve() {
  string s1, s2;
  cin >> s1 >> s2;
  int n1 = s1.size(), n2 = s2.size();
  string temp = s1;
  if (n2 > n1) {
    cout << temp << endl;
    return;
  }
  vector<int> v(n2, -1);
  int j = 0;
  for (int i = 1; i < n2; i++) {
    if (s2[i] == s2[j]) {
      v[i] = j;
      j++;
    } else {
      j = 0;
      if (s2[i] == s2[j]) {
        v[i] = j;
        j++;
      }
    }
  };
  int zero = 0, one = 0;
  for (char ch : s1) {
    ch == '1' ? one++ : zero++;
  }
  bool flag = 1;
  for (int i = 0; i < n2; i++) {
    if (s2[i] == '0' and zero) {
      zero--;
      s1[i] = '0';
    } else if (s2[i] == '1' and one) {
      one--;
      s1[i] = '1';
    } else {
      flag = 0;
      break;
    }
  }
  if (flag == 0) {
    cout << temp << endl;
    return;
  };
  ;
  ;
  j = v[n2 - 1] + 1;
  int ii = n2;
  for (int i = n2; i < n1; i++) {
    if (s2[j] == '0' and zero) {
      s1[i] = '0';
      zero--;
      j++;
    } else if (s2[j] == '1' and one) {
      s1[i] = '1';
      one--;
      j++;
    } else {
      break;
    }
    if (j == n2) j = v[n2 - 1] + 1;
    ii++;
  };
  while (ii < n1) {
    if (one) {
      s1[ii] = '1';
      one--;
    } else if (zero) {
      s1[ii] = '0';
      zero--;
    } else {
      break;
    }
    ii++;
  };
  ;
  cout << s1 << endl;
}
int32_t main() {
  file();
  int test = 1;
  while (test--) {
    solve();
  }
}
