CF ZgukistringZ

B. ZgukistringZ

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Professor GukiZ doesn't accept string as they are. He likes to swap some letters in string to obtain a new one.

GukiZ has strings a, b, and c. He wants to obtain string k by swapping some letters in a, so that k should contain as many non-overlapping substrings equal either to b or c as possible. Substring of string x is a string formed by consecutive segment of characters from x. Two substrings of string x overlap if there is position i in string x occupied by both of them.

GukiZ was disappointed because none of his students managed to solve the problem. Can you help them and find one of possible stringsk?

Input

The first line contains string a, the second line contains string b, and the third line contains string c (1 ≤ |a|, |b|, |c| ≤ 105, where |s|denotes the length of string s).

All three strings consist only of lowercase English letters.

It is possible that b and c coincide.

Output

Find one of possible strings k, as described in the problem statement. If there are multiple possible answers, print any of them.

Sample test(s)

input

aaa
a
b

output

aaa

input

pozdravstaklenidodiri
niste
dobri

output

nisteaadddiiklooprrvz

input

abbbaaccca
ab
aca

output

ababacabcc

Note

In the third sample, this optimal solutions has three non-overlaping substrings equal to either b or c on positions 1 – 2 (ab), 3 – 4 (ab),5 – 7 (aca). In this sample, there exist many other optimal solutions, one of them would be acaababbcc.

题意：给出三个串A,B,C,要求B串在A串出现的个数+C串在A串中出现的个数 总和最大。A串的任意两个字母都可以交换，且每个字母不能重复使用。最后输出A串重排后的串。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int MAXN = 100005;
const int INF = 99999999;

char s1[MAXN] , s2[MAXN] , s3[MAXN];
int main()
{
    int k1[30],k2[30],k3[30];
    scanf("%s%s%s",s1,s2,s3);

    memset(k1,0,sizeof(k1));
    memset(k2,0,sizeof(k2));
    memset(k3,0,sizeof(k3));
    for(int i=0; s1[i]!='\0'; i++)
        k1[s1[i]-'a']++;
    for(int i=0; s2[i]!='\0'; i++)
        k2[s2[i]-'a']++;
    for(int i=0; s3[i]!='\0'; i++)
        k3[s3[i]-'a']++;

    int tmp[30],cnt1,cnt2 ,flag=1 ,ansb=0,ansc=0;
    memcpy(tmp,k1,sizeof(k1));
    cnt1=INF;
    for(int i=0; i<26; i++)
    {
        if(k2[i]>tmp[i])
        {
            flag=0;
            break;
        }
        if(k2[i])
        cnt1=min(cnt1,tmp[i]/k2[i]);
    }
    if(flag==0||cnt1==INF)
    {
       cnt1=0;
    }
    for(int i=0; i<=cnt1; i++){
        cnt2=INF; flag=1;
        for(int j=0; j<26; j++)
        {
            if(k3[j]>tmp[j]-k2[j]*i)
            {
                flag=0;
                break;
            }
            if(k3[j])
            cnt2=min(cnt2,(tmp[j]-k2[j]*i)/k3[j]);
        }
        if(flag==0||cnt2==INF)
            cnt2=0;
        if(i+cnt2>ansb+ansc)
            ansb=i, ansc=cnt2;
    }
    for(int i=0; i<26; i++)
    {
        tmp[i]-=(k2[i]*ansb+k3[i]*ansc);
    }

    while(ansb>0)
        printf("%s",s2),ansb--;
    while(ansc>0)
        printf("%s",s3),ansc--;
    for(int i=0; i<26; i++)
        while(tmp[i]--)
        printf("%c",i+'a');
    printf("\n");
}