2013_14_C5_3

// Task Name : Ekspolzije
/*
At first I thought that the explosion might be able to contain the same character twice. That created a lot of problems. 
The original problem did not have any additional constraints. I wonder how anyone would solve it given these constraints.
*/
#include <stdio.h>
#include <string.h>
#define     z       1000006
using namespace std;
int k1,k2,j;
char s1[z], s2[z],s3[z];
 
inline void check(){
    if(j < k2-1) return;
    int fl,i;
 
    fl = 1;
    for(i = 0; i < k2; i++){
        if(s2[i] != s3[j-(k2-1)+i])
            fl =0;
    }
 
    if(fl==0) return;
    j = j - k2;
    return;
}
int main()
{
    int i;
 
    scanf("%s %s",&s1, &s2);
 
    k1 = strlen(s1);
    k2 = strlen(s2);
 
    j = 0;
    i = 0;
    while(1){
        if(i==k1) break;
 
        s3[j] = s1[i];
        check();
        j++;
        i++;
    }
 
    if(j==0) printf("FRULA\n");
    if(j > 0){
        for(i = 0; i < j ; i++)
            printf("%c",s3[i]);
        printf("\n");
    }
    return 0;
}