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

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

using scalar_t = __int128_t;

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;
}

string construct0(scalar_t Y, scalar_t I, scalar_t W) {
    string ret = "";
    ret += string(Y / 2, 'y');
    ret += string(I / 2, 'i');
    ret += string(W, 'w');
    ret += string(I - I / 2, 'i');
    ret += string(Y - Y / 2, 'y');
    return ret;
}

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

string construct2(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;
    string ret = "";
    ret += string(Y / 2, 'y');
    ret += string(i_l - (iwiwi_l + 2), 'i');
    ret += "iwi";
    for (int i = 0; i < iwiwi_l; ++i) {
        ret += "wi";
    }
    ret += string(w_c, 'w');
    ret += "iwi";
    for (int i = 0; i < iwiwi_r; ++i) {
        ret += "wi";
    }
    ret += string(i_r - (iwiwi_r + 2), 'i');
    ret += string(Y - Y / 2, 'y');
    return ret;
}

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 = I / 2;
        scalar_t iwi = calc1(I, W, i_l, 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;
        }
    }

    string ans;
    if (max_type == 0) {
        ans = construct0(Y, I, W);
    } else if (max_type == 1) {
        ans = construct1(Y, I, W, max_iwiwi, max_i_l);
    } else {
        ans = construct2(Y, I, W, max_iwiwi);
    }
    cout << ans << '\n';
}

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