#include<bits/stdc++.h>
using namespace std;
typedef  long long LL;
typedef pair<int,int> PII;
const int N=1000010,M=2000010;
const int mod=998244353;
int INF = 1e9;
int h[N],e[M],ne[M],idx;
int T=1;
int st[N],primes[N],cnt;





void solve(){
   int n,m,k;
   cin>>n>>m>>k;
   string s[n];
   map<string,int> mp;

   for(int i=0;i<n;i++) cin>>s[i];

    for(int i=0;i<n;i++){
        string t;

        for(int j=0;j<m*k;j++){
            t+=s[i][j];
            if(j%k==k-1){
                //cout<<t<<endl;
                if(mp.count(t)||(i==0&&j==k-1)) mp[t]=1;
                else{
                    cout<<i+1<<" "<<j/k+1<<endl;
                    return ;
                }
                t.clear();
            }
        }
    }
}

    
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //int T=1;
    //cin>>T;
    while(T--) solve();
 
    return 0;
}