1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4.  
  5. #define ll long long
  6. #define db double
  7. #define el "\n"
  8. #define ld long double
  9. #define rep(i,n) for(int i=0;i<n;i++)
  10. #define rev(i,n) for(int i=n;i>=0;i--)
  11. #define rep_a(i,a,n) for(int i=a;i<n;i++)
  12. #define all(ds) ds.begin(), ds.end()
  13. #define ff first
  14. #define ss second
  15. #define pb push_back
  16. #define mp make_pair
  17. typedef vector< long long > vi;
  18. typedef pair<long long, long long> ii;
  19.  
  20.  
  21. int main(){
  22.     ios_base::sync_with_stdio(false);
  23.     cin.tie(0);
  24.     cout.tie(0);
  25.     #ifndef ONLINE_JUDGE
  26.     freopen("input.txt", "r" , stdin);
  27.     freopen("output.txt", "w" , stdout);
  28.     #endif
  29.     int T=1;
  30.     cin >> T;
  31.     while(T--){
  32.     
  33.         ll n,m,k;
  34.         cin>>n>>m>>k;
  35.  
  36.         string s[n];
  37.         rep(i,n) cin>>s[i];
  38.  
  39.         vector<vector<vector<int> > > dp(n, vector<vector<int> >(m, vector<int>(2,0)));
  40.  
  41.         dp[0][0][1] = dp[0][0][0] = k/2;
  42.  
  43.         if(k&1){
  44.             dp[0][0][(int)(s[0][0]-'0')]++;
  45.         } 
  46.  
  47.         rep(i,n){
  48.             rep(j,m){
  49.                 if(!(i+j)) continue;
  50.                 int tot = 0;
  51.                 if(i>0) tot+=dp[i-1][j][1];
  52.                 if(j>0) tot+=dp[i][j-1][0];
  53.  
  54.                 if(j==m-1){
  55.                     dp[i][j][0]=tot;
  56.                     if(s[i][j]=='1' && tot>0){
  57.                         dp[i][j][1]++;
  58.                         dp[i][j][0]--;
  59.                     }
  60.                 }
  61.                 else if(i==n-1){
  62.                     dp[i][j][1]=tot;
  63.                     if(s[i][j]=='0' && tot>0){
  64.                         dp[i][j][0]++;
  65.                         dp[i][j][1]--;
  66.                     }
  67.                 }
  68.                 else{
  69.                     dp[i][j][0] = dp[i][j][1] = tot/2;
  70.                     if(tot&1){
  71.                         if(s[i][j]=='1') dp[i][j][1]++;
  72.                         else dp[i][j][0]++;
  73.                     }
  74.                 }
  75.             }
  76.         }
  77.  
  78.         int x=0, y=0;
  79.  
  80.         while(1){
  81.             int tot = dp[x][y][0]+dp[x][y][1];
  82.             if(s[x][y]=='1'){
  83.                 if(tot&1) x++;
  84.                 else y++;
  85.             }
  86.             else{
  87.                 if(tot&1) y++;
  88.                 else x++;
  89.             }
  90.  
  91.             tot = dp[x][y][0]+dp[x][y][1];
  92.  
  93.             if(x==n-1 && y==m-1) break;
  94.             if(x==n-1 && (tot>1 || s[x][y]=='1')) break;
  95.             if(y==m-1 && (tot>1 || s[x][y]=='0')) break;
  96.  
  97.  
  98.         }
  99.  
  100.         cout<<x+1<<" "<<y+1<<'\n';
  101.     }
  102.     cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
  103.     return 0;
  104. }