#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <cmath>
#include <chrono>
#include <random>
#include <iomanip>
#define chmx(x, y) x=max(x,y)
#define chmn(x, y) x=min(x,y)
//#define x first
//#define y second
using namespace std;
const int N = 2e5 + 5;
const int P = 131;
const int M = 1e6 + 10;
const int mod = 123456789;
const int INF = 0x3f3f3f3f;
typedef long long ll;
typedef pair<ll, ll>PII;
int n, m, k, ans;
int st[100010];
string s[100010];
int dis(string a, string b) {
    int res = 0;
    for (int i = 0; i < m; i++) {
        res += (a[i] != b[i]);
    }
    return res;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m >> k;
    for (int i = 0; i < n; i++)cin >> s[i];
    queue<int>q;
    q.push(0);
    while (q.size()) {
        auto t = q.front();
        q.pop();
        if (st[t])continue;
        bool flag = 1;
        for (int i = 0; i < n; i++) {
            if (i == t)continue;
            int d = dis(s[i], s[t]);
            if (d != k) {
                flag = 0;
                st[i] = 1;
                st[t] = 1;
            }
            else {
                q.push(i);
            }
        }
        if (flag) {
            cout << t + 1 << '\n';
            break;
        }
    }
    return 0;
}