bestcoder15_love

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <map>
#include <algorithm>
#include <queue>
#include <cmath>
#include <bitset>
using namespace std;

// 大数，内存处理
#define INF 0x3f3f3f3f
#define ll long long int
#define MEM(a) memset(a, 0, sizeof(a))
#define MEMM(a) memset(b, -1, sizeof(b))
#define DEB(x, n) cout << (x) << " " << (n) << endl;

// 字符串处理
#define SL(a) strlen(a)
#define SCM(a, b) strcmp(a, b)
#define SCP(a, b) strcpy(a, b)

// 输入函数
#define RS(s) scanf("%s", (s))
#define RI(a) scanf("%d", &(a))
#define PI(r) printf("%d\n", (r))
#define PS(s) printf("%s\n", (s))
#define RII(a, b) scanf("%d%d", &(a), &(b))
#define RIII(a, b, c) scanf("%d%d%d", &(a), &(b), &(c))

// 应对ONLINE_JUDGE, 读入读出处理
// 利用bash脚本调试数据
#ifdef ONLINE_JUDGE
#define FOI(file) 0
#define FOW(file) 0
#else
#define FOI(file) freopen(file,"r",stdin);
#define FOW(file) freopen(file,"w",stdout);
#endif

// 定义常用工作变量
int t, i, j, k;

int main()
{
    //FOI("input");
    //FOW("output");
    //write your programme here

    char father[30], mother[30];
    int len1, len2;
    while(~scanf("%s", father))
    {
        scanf("%s", mother);

        len1 = strlen(father);
        len2 = strlen(mother);

        for(i = 0; i <len1;  i++)
        {
            if(father[i] == '_')
            {
                break;
            }
        }

        for(j = 0; j < len2; j++)
        {
            if(mother[j] == '_')
            {
                break;
            }
        }

        for(k = i+1; k < len1; k++)
            printf("%c", father[k]);

        printf("_small_");
        for(k = j+1; k < len2; k++)
            printf("%c", mother[k]);
        printf("\n");
    }
    return 0;
}