Problem: The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After some continuous discussion, they came up with a schedule s, which can be represented as a binary string, in which the i-th symbol is '1' if students will write the contest in the i-th day and '0' if they will have a day off.

At the last moment Gleb said that the camp will be the most productive if it runs with the schedule t (which can be described in the same format as schedule s). Since the number of days in the current may be different from number of days in schedule t, Gleb required that the camp's schedule must be altered so that the number of occurrences of t in it as a substring is maximum possible. At the same time, the number of contest days and days off shouldn't change, only their order may change.

Could you rearrange the schedule in the best possible way?

Input

The first line contains string s (1 ⩽ |s| ⩽ 500 000), denoting the current project of the camp's schedule.

The second line contains string t (1 ⩽ |t| ⩽ 500 000), denoting the optimal schedule according to Gleb.

Strings s and t contain characters '0' and '1' only.

Output

In the only line print the schedule having the largest number of substrings equal to t. Printed schedule should consist of characters '0' and '1' only and the number of zeros should be equal to the number of zeros in s and the number of ones should be equal to the number of ones in s.

In case there multiple optimal schedules, print any of them.

Examples

Input


101101
110


Output


110110

Input


10010110
100011


Output


01100011


Input


10
11100


Output


01

Note

In the first example there are two occurrences, one starting from first position and one starting from fourth position.

In the second example there is only one occurrence, which starts from third position. Note, that the answer is not unique. For example, if we move the first day (which is a day off) to the last position, the number of occurrences of t wouldn't change.

In the third example it's impossible to make even a single occurrence.

Solution (in JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.UncheckedIOException;
import java.util.Objects;
import java.nio.charset.Charset;
import java.util.StringTokenizer;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.BufferedReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author mikit
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        LightScanner in = new LightScanner(inputStream);
        LightWriter out = new LightWriter(outputStream);
        DCampSchedule solver = new DCampSchedule();
        solver.solve(1, in, out);
        out.close();
    }

    static class DCampSchedule {
        public void solve(int testNumber, LightScanner in, LightWriter out) {
            String s = in.string(), t = in.string();
            if (s.length() < t.length()) {
                out.ansln(s);
                return;
            }
            int[] c = {0, 0};
            for (int i = 0; i < s.length(); i++) {
                c[s.charAt(i) - '0']++;
            }

            RollingHash rh = new RollingHash(t);
            int common = 0;
            for (int i = 1; i < t.length(); i++) {
                if (rh.match(0, i, t.length() - i, t.length())) {
                    common = i;
                }
            }

            int[] bc = {0, 0};
            for (int i = 0; i < t.length(); i++) {
                bc[t.charAt(i) - '0']++;
            }

            int[] ac = {0, 0};
            for (int i = common; i < t.length(); i++) {
                ac[t.charAt(i) - '0']++;
            }

            if (c[0] < bc[0] || c[1] < bc[1]) {
                out.ansln(s);
                return;
            }

            out.print(t);
            c[0] -= bc[0];
            c[1] -= bc[1];

            while (c[0] >= ac[0] && c[1] >= ac[1]) {
                //System.out.println(c[0] + "," + c[1]);
                c[0] -= ac[0];
                c[1] -= ac[1];
                for (int i = common; i < t.length(); i++) {
                    out.print(t.charAt(i));
                }
            }

            for (; c[0] > 0; c[0]--) {
                out.print('0');
            }
            for (; c[1] > 0; c[1]--) {
                out.print('1');
            }
            out.ln();
        }

    }

    static class LightScanner {
        private BufferedReader reader = null;
        private StringTokenizer tokenizer = null;

        public LightScanner(InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
        }

        public String string() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new UncheckedIOException(e);
                }
            }
            return tokenizer.nextToken();
        }

    }

    static class Vec3l implements Comparable<Vec3l> {
        public long x;
        public long y;
        public long z;

        public Vec3l(long x, long y, long z) {
            this.x = x;
            this.y = y;
            this.z = z;
        }

        public boolean equals(Object o) {
            if (this == o) return true;
            if (o == null || getClass() != o.getClass()) return false;
            Vec3i vec3i = (Vec3i) o;
            return x == vec3i.x &&
                    y == vec3i.y &&
                    z == vec3i.z;
        }

        public int hashCode() {
            return Objects.hash(x, y, z);
        }

        public String toString() {
            return "(" + x + ", " + y + ", " + z + ")";
        }

        public int compareTo(Vec3l o) {
            if (x == o.x) {
                if (y == o.y) {
                    return Long.compare(z, o.z);
                }
                return Long.compare(y, o.z);
            }
            return Long.compare(x, o.x);
        }

    }

    static class Vec3i implements Comparable<Vec3i> {
        public int x;
        public int y;
        public int z;

        public Vec3i(int x, int y, int z) {
            this.x = x;
            this.y = y;
            this.z = z;
        }

        public boolean equals(Object o) {
            if (this == o) return true;
            if (o == null || getClass() != o.getClass()) return false;
            Vec3i vec3i = (Vec3i) o;
            return x == vec3i.x &&
                    y == vec3i.y &&
                    z == vec3i.z;
        }

        public int hashCode() {
            return Objects.hash(x, y, z);
        }

        public String toString() {
            return "(" + x + ", " + y + ", " + z + ")";
        }

        public int compareTo(Vec3i o) {
            if (x == o.x) {
                if (y == o.y) {
                    return Integer.compare(z, o.z);
                }
                return Integer.compare(y, o.z);
            }
            return Integer.compare(x, o.x);
        }

    }

    static class LongEuclidSolver {
        private LongEuclidSolver() {
        }

        public static Vec3l solve(long p, long q) {
            if (q == 0) {
                return new Vec3l(p, 1, p);
            }
            Vec3l vals = solve(q, p % q);
            long a = vals.y;
            long b = vals.x - (p / q) * a;
            return new Vec3l(a, b, vals.z);
        }

    }

    static class RollingHash {
        private static final int[] DEFAULT_MOD = {999999937, 1000000007, 1000000009};
        private static final int DEFAULT_BASE = 9973;
        private final String str;
        private final int[] mod;
        private final Exponentiation[] power;
        private final long[][] hash;

        public RollingHash(String str, int[] mod, int base) {
            this.str = str;
            this.mod = mod;
            int n = str.length(), m = mod.length;
            hash = new long[m][n + 1];
            power = new Exponentiation[m];
            for (int i = 0; i < m; i++) {
                power[i] = new ModMath(mod[i]).getExponentiation(base, n + 1);
                hash[i][0] = 0;
                for (int j = 0; j < n; j++) {
                    hash[i][j + 1] = ((hash[i][j] * base + str.charAt(j)) % mod[i]);
                }
            }
        }

        public RollingHash(String str) {
            this(str, DEFAULT_MOD, DEFAULT_BASE);
        }

        public long hash(int l, int r, int i) {
            return ((hash[i][r] - hash[i][l] * power[i].pow(r - l)) % mod[i] + mod[i]) % mod[i];
        }

        public boolean match(int l1, int r1, int l2, int r2) {
            for (int i = 0; i < mod.length; i++) {
                if (hash(l1, r1, i) != hash(l2, r2, i)) {
                    return false;
                }
            }
            return true;
        }

    }

    static class LightWriter implements AutoCloseable {
        private final Writer out;
        private boolean autoflush = false;
        private boolean breaked = true;

        public LightWriter(Writer out) {
            this.out = out;
        }

        public LightWriter(OutputStream out) {
            this(new BufferedWriter(new OutputStreamWriter(out, Charset.defaultCharset())));
        }

        public LightWriter print(char c) {
            try {
                out.write(c);
                breaked = false;
            } catch (IOException ex) {
                throw new UncheckedIOException(ex);
            }
            return this;
        }

        public LightWriter print(String s) {
            try {
                out.write(s, 0, s.length());
                breaked = false;
            } catch (IOException ex) {
                throw new UncheckedIOException(ex);
            }
            return this;
        }

        public LightWriter ans(String s) {
            if (!breaked) {
                print(' ');
            }
            return print(s);
        }

        public LightWriter ansln(String... n) {
            for (String n1 : n) {
                ans(n1).ln();
            }
            return this;
        }

        public LightWriter ln() {
            print(System.lineSeparator());
            breaked = true;
            if (autoflush) {
                try {
                    out.flush();
                } catch (IOException ex) {
                    throw new UncheckedIOException(ex);
                }
            }
            return this;
        }

        public void close() {
            try {
                out.close();
            } catch (IOException ex) {
                throw new UncheckedIOException(ex);
            }
        }

    }

    static class Exponentiation {
        private final ModMath mod;
        private final long base;
        private final int max;
        private final long[] natural;
        private final long[] reverse;

        public Exponentiation(ModMath mod, long base, int max) {
            this.mod = mod;
            this.base = base;
            this.max = max;
            this.natural = new long[max];
            this.reverse = new long[max];
            natural[0] = 1;
            for (int i = 1; i < max; i++) {
                natural[i] = mod.mod(natural[i - 1] * base);
            }
            reverse[max - 1] = mod.inv(natural[max - 1]);
            for (int i = max - 1; i > 0; i--) {
                reverse[i - 1] = mod.mod(reverse[i] * base);
            }
        }

        public long pow(int x) {
            if (x >= 0) {
                return natural[x];
            } else {
                return reverse[-x];
            }
        }

        public String toString() {
            return "Exponentiation{" +
                    "natural=" + Arrays.toString(natural) +
                    ", reverse=" + Arrays.toString(reverse) +
                    '}';
        }

    }

    static class ModMath {
        private static final int DEFAULT_MOD = 1_000_000_007;
        private final long mod;

        public ModMath(long mod) {
            this.mod = mod;
        }

        public ModMath() {
            this(DEFAULT_MOD);
        }

        public long mod(long x) {
            x %= mod;
            return x < 0 ? x + mod : x;
        }

        public long inv(long x) {
            return mod(LongEuclidSolver.solve(x, -mod).x);
        }

        public Exponentiation getExponentiation(long base, int max) {
            return new Exponentiation(this, base, max);
        }

    }
}