#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <unordered_map>
#include <cmath>
#include <deque>
#include <stack>
#include <iomanip>
#include <queue>
using namespace std;
int z = 1e9 + 7;
bool cmp(char a , char b)
{
     return a > b;
}
int main()
{
     cin.tie(0),cout.sync_with_stdio(0);
     int t;
     // cin >> t;
     t = 1;
     while(t--)
     {
          int n , m , k;
          cin >> n >> m >> k;
          vector<string> ss(n);
          for(int i = 0 ; i < n ; i++)
          {
               cin >> ss[i];
          }
          int ans1 , ans2 = 0;
          if(ss[0] != ss[1])
          {
               if(n == 2)
               {
                    ans1 = 2;
                    for(int i = 0 ; i < m * k && !ans2; i++)
                    {
                         if(ss[1][i] != ss[0][i])
                         {
                              ans2 = (i + k) / k;
                         }
                    }
               }
               else if(ss[2] == ss[0])
               {
                    ans1 = 2;
                    for(int i = 0 ; i < m * k && !ans2; i++)
                    {
                         if(ss[1][i] != ss[0][i])
                         {
                              ans2 = (i + k) / k;
                         }
                    }
               }
               else
               {
                    ans1 = 1;
                    for(int i = 0 ; i < m * k && !ans2; i++)
                    {
                         if(ss[1][i] != ss[0][i])
                         {
                              ans2 = (i + k) / k;
                         }
                    }
               }
          }
          else
          {
               for(int i = 0 ; i < n ; i++)
               {
                    if(ss[i] != ss[0]) ans1 = i + 1;
               }
               for(int i = 0 ; i < m * k && !ans2; i++)
               {
                    if(ss[ans1 - 1][i] != ss[0][i])
                    {
                         ans2 = (i + k) / k;
                    }
               }
          }
          cout << ans1 << " " << ans2 << endl;
     }
}