#include<iostream>

using namespace std;

int matrix[222];
unsigned long long int comb[204][204];
int loop;

void _Comb(int n, int m)
{
    for(int i=0;i<=n;i++)
    {
        comb[0][i] = 1;
    }
    for(int i=0;i<=m;i++)
    {
        comb[i][0] = 1;
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            comb[i][j] = comb[i-1][j] + comb[i][j-1];
        }
    }
}

void _Init_matrix ()
{
    for(int i = 0;i < 222 ; i++)
    {
        matrix[i] = 0;
    }
    loop = 0;
}

int _Set_matrix (int n, int m, int k)
{
    if(n == 0 && m == 0)
    {
        return 0;
    }

    unsigned long long int cutout;

    if(n + m - 2 < 0)
    {
        cutout = 1;
    }
    else if(n - 1 < 0 && n + m - 2 >= 0)
    {
        cutout = comb[n + m - 2][m - 1];
    }
    else if(n - 1 >= 0 && n + m - 2 >= 0)
    {
        cutout = comb[n + m - 2][n - 1];
    }

    if(n > 0 && k <= cutout)
    {
        _Set_matrix (n - 1, m, k);
        matrix[loop++] = 0;
        return 0;
    }
    _Set_matrix (n, m - 1, k - cutout);
    matrix[loop++] = 1;
    return 0;
}

int main(void)
{
    int case_cnt;
    int n, m, k;

    cin >> case_cnt;
    while(case_cnt--)
    {
        cin >> n >> m >> k;

        _Comb(n + m, n + m);
        _Set_matrix(n, m, k);
        for(int i=n+m-1;i>=0;i--)
        {
            if(matrix[i] == 0)
            {
                cout << "-";
            }
            if(matrix[i] == 1)
            {
                cout << "o";
            }
        }
        cout << endl;
        _Init_matrix();
    }
}