1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int main() {
  5.     int tt;
  6.     cin >> tt;
  7.     while (tt--) {
  8.         int n, m, k;
  9.         cin >> n >> m >> k;
  10.         vector<string> s(n);
  11.         for (int i = 0; i < n; i++) {
  12.             cin >> s[i];
  13.         }
  14.         vector<vector<int>> a(n, vector<int>(m));
  15.         a[0][0] = k;
  16.         int x = 0;
  17.         int y = 0;
  18.         vector<pair<int, int>> t(n * m);
  19.         for (int i = 0; i < n; i++) {
  20.             for (int j = 0; j < m; j++) {
  21.                 t[i * m + j] = make_pair(i, j);
  22.             }
  23.         }
  24.         t.pop_back();
  25.         sort(t.begin(), t.end(), [&](pair<int, int> i, pair<int, int> j) {
  26.             if (i.first + i.second == j.first + j.second) {
  27.                 return i < j;
  28.             } else {
  29.                 return i.first + i.second < j.first + j.second;
  30.             }
  31.         });
  32.         for (auto [i, j] : t) {
  33.             if (a[i][j] == 0) {
  34.                 continue;
  35.             }
  36.             if (i == n - 1) {
  37.                 if (s[i][j] == '0') {
  38.                     a[i][j]--;
  39.                     a[i][j + 1]++;
  40.                     if (i == x && j == y && a[i][j] == 0) {
  41.                         y++;
  42.                     }
  43.                 }
  44.             } else if (j == m - 1) {
  45.                 if (s[i][j] == '1') {
  46.                     a[i][j]--;
  47.                     a[i + 1][j]++;
  48.                     if (i == x && j == y && a[i][j] == 0) {
  49.                         x++;
  50.                     }
  51.                 }
  52.             } else {
  53.                 if (s[i][j] == '0') {
  54.                     a[i][j + 1] += (a[i][j] + 1) / 2;
  55.                     a[i + 1][j] += a[i][j] / 2;
  56.                     if (i == x && j == y) {
  57.                         if (a[i][j] % 2 == 1) {
  58.                             y++;
  59.                         } else {
  60.                             x++;
  61.                         }
  62.                     }
  63.                 } else {
  64.                     a[i + 1][j] += (a[i][j] + 1) / 2;
  65.                     a[i][j + 1] += a[i][j] / 2;
  66.                     if (i == x && j == y) {
  67.                         if (a[i][j] % 2 == 1) {
  68.                             x++;
  69.                         } else {
  70.                             y++;
  71.                         }
  72.                     }
  73.                 }
  74.             }
  75.         }
  76.         cout << x + 1 << " " << y + 1 << endl;
  77.     }
  78.     return 0;
  79. }