#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

void solve(int n, int m, int k) {
  int k1 = k;
  if (n == 2 && m == 2 && k == 2) {
    cout << "10\n01\n";
    return;
  }
  bool col_swap = false;
  if (k * 2 > n * m) {
    k = n * m - k;
    col_swap = true;
  }
  vector<vector<int>> ans(n, vector<int>(m));
  if (n == 4 && m == 4 && k == 8) {
    ans[0] = {1, 1, 0, 1};
    ans[1] = {1, 0, 0, 0};
    ans[2] = {0, 0, 0, 1};
    ans[3] = {1, 0, 1, 1};
    k = 0;
  } else if (n == 4 && m == 5 && k == 9) {
    ans[0] = {1, 1, 1, 0, 0};
    ans[1] = {1, 1, 0, 0, 0};
    ans[2] = {1, 0, 0, 0, 1};
    ans[3] = {0, 0, 0, 1, 1};
    k = 0;
  } else if (n == 6 && m == 7 && k == 20) {
    ans[0] = {1, 1, 1, 1, 0, 0, 0};
    ans[1] = {1, 1, 1, 0, 0, 0, 0};
    ans[2] = {1, 1, 0, 0, 0, 0, 1};
    ans[3] = {1, 0, 0, 0, 0, 1, 1};
    ans[4] = {0, 0, 0, 0, 1, 1, 1};
    ans[5] = {0, 0, 0, 1, 1, 1, 1};
    k = 0;
  } else {
    int sum = 0;
    while (k > 0) {
      int cur_cnt = 0;
      for (int i = 0; i < n; ++i) {
        int j = sum - i;
        if (j >= 0 && j < m)
          ++cur_cnt;
      }
      if (cur_cnt > k)
        break;
      k -= cur_cnt;
      for (int i = 0; i < n; ++i) {
        int j = sum - i;
        if (j >= 0 && j < m)
          ans[i][j] = 1;
      }
      ++sum;
    }
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < m && k > 0; ++j) {
        bool can = true;
        for (int dx = -1; dx <= 1; ++dx) {
          for (int dy = -1; dy <= 1; ++dy) {
            if (i + dx >= 0 && i + dx < n && j + dy >= 0 && j + dy < m && ans[i + dx][j + dy] == 1)
              can = false;
          }
        }
        if (can) {
          --k;
          ans[i][j] = 1;
        }
      }
    }
  }
  if (k != 0) {
    cerr << "BUG!!!\n";
    cerr << n << ' ' << m << ' ' << k1 << '\n';
  }

  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j)
      cout << (ans[i][j] ^ col_swap);
    cout << '\n';
  }
  //cerr << '\n';
}

//#define STRESS

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);

#ifdef STRESS
  for (int sum = 0; sum < 1000; ++sum) {
    for (int n = 2; sum - n >= 2; ++n) {
      int m = sum - n;
      for (int k = 0; k <= n * m; ++k)
        solve(n, m, k);
    }
  }
#else
  int t;
  cin >> t;
  while (t--) {
    int n, m, k;
    cin >> n >> m >> k;
    solve(n, m, k);
  }
#endif
  return 0;
}