#include <bits/stdc++.h>
const int N = 1e6+7;
using namespace std;
typedef long long ll ;
typedef unsigned long long ull;
ull I = 131,h[N],p[N];
string s[N];
ull Hash[N][8];
ll n,m,k;
ull get_hash(vector <ull>& a){
    for(int i = 0;i<n;i++){
        if(i==0) p[i] = a[i];
        else p[i] = p[i-1]*I + a[i];
    }
    return p[n-1];
}
int main()
{

    cin>>n>>m>>k;
    for(int i = 0;i<n;i++){
        cin>>s[i];
    }
    for(int i = 0;i<m;i++){
        for(int ch = 0; ch <= 4;ch++){
            vector<ull> t;
            char cha = ch + 'A';
            for(int j = 0;j < n;j++){
                if(cha != s[j][i]) t.push_back(1);
                else t.push_back(0);
            }

            Hash[i][ch] = get_hash(t);
        }
    }
    vector<ull> ans(n,k);
    int res = 0;
    for(int i = 0;i<n;i++){
        ans[i] = 0;
        ull hass = get_hash(ans);
        ull t = 0;
        for(int j = 0;j<m;j++){
            t += Hash[j][s[i][j]-'A'] ;
        }
       // cout<<t<<'\n';
        if(hass == t) res =  i+1;
        ans[i] = k;
    }
    cout<<res<<'\n';
    return 0;
}