#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;

using scalar_t = __int128_t;

std::ostream &operator<<(std::ostream &dest, __int128_t value) {
    std::ostream::sentry s(dest);
    if (s) {
        __uint128_t tmp = value < 0 ? -value : value;
        char buffer[128];
        char *d = std::end(buffer);
        do {
            --d;
            *d = "0123456789"[tmp % 10];
            tmp /= 10;
        } while (tmp != 0);
        if (value < 0) {
            --d;
            *d = '-';
        }
        int len = std::end(buffer) - d;
        if (dest.rdbuf()->sputn(d, len) != len) {
            dest.setstate(std::ios_base::badbit);
        }
    }
    return dest;
}

scalar_t calc_val(string &S, scalar_t A, scalar_t B) {
    vector<scalar_t> dp(6);
    dp[0] = 1;
    for (int i = 0; i < (int)S.size(); ++i) {
        if (S[i] == 'y') {
            dp[5] += dp[4];
            dp[1] += dp[0];
        } else if (S[i] == 'i') {
            dp[4] += dp[3];
            dp[2] += dp[1];
        } else {
            dp[3] += dp[2];
        }
    }
    scalar_t val = dp[5] * A;
    for (int i = 0; i + 4 < (int)S.size(); ++i) {
        if (S.substr(i, 5) == "iwiwi") {
            val += B;
        }
    }
    return val;
}

template <class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}

scalar_t calc1(scalar_t I, scalar_t W, scalar_t i_l, scalar_t w_i) {
    scalar_t ret = -W * i_l * i_l + (I * W - w_i * (w_i + 1)) * i_l + w_i * (w_i + 1) * I / 2 -
                   w_i * (w_i + 1) * (2 * w_i + 1) / 6;
    return ret;
}

scalar_t calc2(scalar_t i_l, scalar_t i_r, scalar_t w_c, scalar_t w_il, scalar_t w_ir) {
    scalar_t ret = i_l * i_r * (w_c + w_il + w_ir) + (i_l - i_r) * w_il * (w_il + 1) / 2 +
                   (i_r - i_l) * w_ir * (w_ir + 1) / 2 - w_il * (w_il + 1) * (2 * w_il + 1) / 6 -
                   w_ir * (w_ir + 1) * (2 * w_ir + 1) / 6;
    return ret;
}

void print0(scalar_t Y, scalar_t I, scalar_t W) {
    for (int i = 0; i < Y / 2; ++i) cout << 'y';
    for (int i = 0; i < I / 2; ++i) cout << 'i';
    for (int i = 0; i < W; ++i) cout << 'w';
    for (int i = 0; i < I - I / 2; ++i) cout << 'i';
    for (int i = 0; i < Y - Y / 2; ++i) cout << 'y';
}

void print1(scalar_t Y, scalar_t I, scalar_t W, scalar_t iwiwi, scalar_t i_l) {
    for (int i = 0; i < Y / 2; ++i) cout << 'y';
    for (int i = 0; i < i_l; ++i) cout << 'i';
    for (int i = 0; i < W - (iwiwi + 1); ++i) cout << 'w';
    cout << "iwi";
    for (int i = 0; i < iwiwi; ++i) {
        cout << "wi";
    }
    for (int i = 0; i < I - i_l - (iwiwi + 2); ++i) cout << 'i';
    for (int i = 0; i < Y - Y / 2; ++i) cout << 'y';
}

void print2(scalar_t Y, scalar_t I, scalar_t W, scalar_t iwiwi) {
    scalar_t iwiwi_l = iwiwi / 2;
    scalar_t iwiwi_r = iwiwi - iwiwi / 2;
    scalar_t w_c = W - iwiwi - 2;
    scalar_t i_l = I / 2;
    scalar_t i_r = I - I / 2;
    for (int i = 0; i < Y / 2; ++i) cout << 'y';
    for (int i = 0; i < i_l - (iwiwi_l + 2); ++i) cout << 'i';
    cout << "iwi";
    for (int i = 0; i < iwiwi_l; ++i) {
        cout << "wi";
    }
    for (int i = 0; i < w_c; ++i) 'w';
    cout << "iwi";
    for (int i = 0; i < iwiwi_r; ++i) {
        cout << "wi";
    }
    for (int i = 0; i < i_r - (iwiwi_r + 2); ++i) cout << 'i';
    for (int i = 0; i < Y - Y / 2; ++i) cout << 'y';
}

void solve() {
    scalar_t Y, I, W, A, B;
    {
        int y, i, w, a, b;
        cin >> y >> i >> w >> a >> b;
        Y = y, I = i, W = w, A = a, B = b;
    }
    scalar_t YY = (Y / 2) * (Y - Y / 2);
    scalar_t max_val = YY * (I / 2) * (I - I / 2) * W * A;
    int max_type = 0;
    scalar_t max_iwiwi = 0;
    scalar_t max_i_l = -1;

    // iwiwi が1箇所に固まってるケース
    int type = 1;
    for (scalar_t iwiwi = 1; iwiwi + 2 <= I && iwiwi + 1 <= W; ++iwiwi) {
        scalar_t i_i = iwiwi + 2;
        scalar_t w_i = iwiwi + 1;
        scalar_t smt = (I * W - w_i * (w_i + 1)) / (2 * W);
        scalar_t i_l = 0;
        scalar_t iwi = calc1(I, W, 0, w_i);
        if (chmax(iwi, calc1(I, W, I - i_i, w_i))) {
            i_l = I - i_i;
        }
        if (0 <= smt && smt <= I - i_i) {
            if (chmax(iwi, calc1(I, W, smt, w_i))) {
                i_l = smt;
            }
        }
        if (0 <= smt + 1 && smt + 1 <= I - i_i) {
            if (chmax(iwi, calc1(I, W, smt + 1, w_i))) {
                i_l = smt + 1;
            }
        }
        scalar_t val = YY * iwi * A + iwiwi * B;
        if (chmax(max_val, val)) {
            max_type = type;
            max_iwiwi = iwiwi;
            max_i_l = i_l;
        }
    }

    // iwiwi が2箇所に固まってるケース
    type = 2;
    for (scalar_t iwiwi = 2; iwiwi + 4 <= I && iwiwi + 2 <= W; ++iwiwi) {
        scalar_t iwiwi_l = iwiwi / 2;
        scalar_t iwiwi_r = iwiwi - iwiwi / 2;
        scalar_t w_il = iwiwi_l + 1;
        scalar_t w_ir = iwiwi_r + 1;
        scalar_t w_c = W - iwiwi - 2;
        scalar_t i_l = I / 2;
        scalar_t i_r = I - I / 2;
        scalar_t iwi = calc2(i_l, i_r, w_c, w_il, w_ir);
        scalar_t val = YY * iwi * A + iwiwi * B;
        if (chmax(max_val, val)) {
            max_type = type;
            max_iwiwi = iwiwi;
        }
    }

    if (max_type == 0) {
        print0(Y, I, W);
    } else if (max_type == 1) {
        print1(Y, I, W, max_iwiwi, max_i_l);
    } else {
        print2(Y, I, W, max_iwiwi);
    }
    // cout << max_val << '\n';
    // cout << calc_val(ans, A, B) << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}