/**
 * @author n685
 * @brief
 * @date 2024-08-26 21:09:43
 *
 *
 */
#include "bits/stdc++.h"

#ifdef LOCAL
#include "dd/debug.h"
#else
#define dbg(...) 42
#define dbg_proj(...) 420
#define dbg_rproj(...) 420420
void nline() {}
void bar() {}
void start_clock() {}
void end_clock() {}
#endif

namespace io {

template <class T> T read() {
  T val;
  if constexpr (std::is_array_v<T>) {
    for (auto &v : val) {
      v = read<T::value_type>();
    }
  } else {
    std::cin >> val;
  }
  return val;
}

template <class T, class U, class... Args> std::tuple<T, U, Args...> read() {
  T l = read<T>();
  return std::tuple_cat(
    std::tuple{std::move(l)}, std::tuple{read<U, Args...>()}
  );
}
// for rv::iota | rv::transform
template <class T> T read_i(int /**/) { return read<T>(); }
template <class T, class U, class... Args>
std::tuple<T, U, Args...> read_i(int /**/) {
  return read<T, U, Args...>();
}

} // namespace io

std::vector<std::vector<bool>> gen(int n, int m, int k) {
  if (n == 3 && m == 4 && k == 5) {
    return {
      {false, true, true, false},
      {true, true, false, false},
      {true, false, false, false}
    };
  }
  if (n == 4 && m == 4 && k == 8) {
    return {
      {true, true, true, true},
      {true, true, false, true},
      {true, false, false, false},
      {false, false, false, false}
    };
  }
  if (n == 5 && m == 6 && k == 14) {
    return {
      {true, true, true, true, false, true},
      {true, true, true, false, false, false},
      {true, true, false, false, false, true},
      {true, false, false, false, false, false},
      {false, false, false, true, false, true}
    };
  }
  const int K = k;
  std::vector<std::vector<std::pair<int, int>>> loc(n + m - 1);
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      loc[i + j].emplace_back(i, j);
    }
  }
  std::vector ans(n, std::vector<bool>(m));
  int mx = 0;
  for (int i = 0; i < n + m - 1; ++i) {
    if (k >= std::ssize(loc[i])) {
      mx = i;
      for (auto [a, b] : loc[i]) {
        ans[a][b] = true;
      }
      k -= static_cast<int>(loc[i].size());
    } else {
      break;
    }
  }
  for (int i = 0; i < n && k > 0; ++i) {
    for (int j = 0; j < m && k > 0; ++j) {
      if ((n - 1 - i) % 2 == 0 && (m - 1 - j) % 2 == 0 && i + j >= mx + 3) {
        ans[i][j] = true;
        --k;
      }
    }
  }
  if (k > 0) {
    dbg(n, m, K);
  }
  return ans;
}

void solve() {
  const auto [n, m, k] = io::read<int, int, int>();
  if (n == 2 && m == 2 && k == 2) {
    std::cout << "10\n";
    std::cout << "01\n";
    return;
  }
  bool rot = n > m;
  bool fl = k > n * m / 2;
  std::vector<std::vector<bool>> ans =
    gen(std::min(n, m), std::max(n, m), std::min(k, n * m - k));
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      bool val = fl ^ (rot ? ans[j][i] : ans[i][j]);
      std::cout << val;
    }
    std::cout << '\n';
  }
#ifdef LOCAL
  std::cout << '\n';
#endif
}

int main() {
#ifndef LOCAL
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
#endif

  int t;
  std::cin >> t;
  for (int i = 0; i < t; ++i) {
    // dbg(i + 1);
    solve();
    // bar();
  }
}