#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma,popcnt")
#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 1000010
#define N 1010
#define int short
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define bitcount(x) __builtin_popcountll(x)
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define ss(x) (int)x.size()
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
int n,m,k;
bitset<4100> a[16401];
short id[4111];
bool has[4111][4];
main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m >> k;
bool ff = 1;
fo(i,1,n)
{
fo(j,0,m - 1)
{
char t;
cin >> t;
if(t == 'A') a[(i - 1) * 4][j] = 1,has[i][0] = 1;
if(t == 'T') a[(i - 1) * 4 + 1][j] = 1,has[i][1] = 1;
if(t == 'G') a[(i - 1) * 4 + 2][j] = 1,has[i][2] = 1;
if(t == 'C') a[(i - 1) * 4 + 3][j] = 1,has[i][3] = 1;
if(has[i][0] and has[i][1] and has[i][2] and has[i][3]) ff = 0;
}
}
fo(i,1,n) id[i] = i;
random_shuffle(id + 1,id + n + 1);
fo(i,1,n)
{
// if(i % 5 == 100) random_shuffle(id + 1,id + n + 1);
bool ok = 1;
fo(x,1,n)
{
short j = id[x];
if(i == j) continue;
short cnt = 0;
fo(h,0,3)
{
if(has[i][h] and has[j][h])
cnt += (a[(i - 1) * 4 + h] ^ a[(j - 1) * 4 + h]).count();
else if(has[i][h]) cnt += a[(i - 1) * 4 + h].count();
else if(has[j][h]) cnt += a[(j - 1) * 4 + h].count();
if(cnt > 2 * k) break;
}
if(cnt != 2 * k)
{
ok = 0;
break;
}
}
if(ok) return cout << i,0;
}
}
