/*
 * Not the fish.
 * INFO
 */

#include <cmath>
#include <ctime>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <vector>
#include <string>
#include <bitset>
#include <queue>
#include <map>
#include <set>

using namespace std;

// SELF TEMPLATE CODE BGEIN

#define sz(x) ((int)((x).size()))
#define out(x) printf(#x" %d\n", x)
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repf(i,a,b) for (int i = (a); i <= (b); ++i)
#define repd(i,a,b) for (int i = (a); i >= (b); --i)
#define repcase int t, Case = 1; for (scanf ("%d", &t); t; --t)
#define repeach(i,x) for (__typeof((x).begin()) i = (x).begin(); i != (x).end(); ++i)

typedef long long int64;
typedef pair<int, int> pii;

int sgn(double x) { return (x > 1e-8) - (x < -1e-8); }
int count_bit(int x) { return x == 0? 0 : count_bit(x >> 1) + (x & 1); }

template<class T> inline void to_min(T &a, const T b) { if (b < a) a = b; }
template<class T> inline void to_max(T &a, const T b) { if (b > a) a = b; }

// SELF TEMPLATE CODE END

int main() {
    // ios::sync_with_stdio(false);

    char s1[22], s2[22];
    while (scanf ("%s%s", s1, s2) != EOF) {
        bool ok = false;
        for (int i = 0; s1[i]; ++i) {
            if (s1[i] != '_') {
                if (ok) putchar (s1[i]);
            } else {
                ok = true;
            }
        }
        printf ("_small_");
        ok = false;
        for (int i = 0; s2[i]; ++i) {
            if (s2[i] != '_') {
                if (ok) putchar (s2[i]);
            } else {
                ok = true;
            }
        }
        puts ("");
    }
    return 0;
}