Under construction

Still being built. Things may change

Class Field Trip

Interview

Time limit1sMemory limit1024 MB

Summary
Given two sorted lowercase strings, print one string that contains all their letters in alphabetical order.
Level

Easy2 of 10

Topics
Sorting, String
Solved
No attempts yet

Problem

Instructors ann and ben firmly believe everything should be alphabetical, especially names. (They also don't believe in capital letters!) They take alphabetical order to such an extreme that they even order the letters of their names when listed together. For example, the last time they co-taught they listed the instructors as abennn! They are taking their classes on a class field trip, so they need to merge their student lists. Fortunately, each list is already in order, so merging is quick. If ann has john and amy in her class and ben has jack and jill in his, their two lists would be ahjmnoy and acijjkll. The field trip list would be aachijjjkllmnoy.

Given ann's and ben's lists, produce the field trip list.

Input

The input consists of exactly two lines. Each line contains a string of from 11 to 100100 lower case letters. These are ann's and ben's lists.

Output

Output a single string of lower case letters that is the merging of ann's and ben's lists.

Examples1

  1. Example 1

    Input
    ahjmnoy
    acijjkll
    
    Expected output
    aachijjjkllmnoy