#include <iostream>

long long N;
long long M;
long long E[3][800];

#define is_kadomatu(a,b,c) (!(a > b && b > c) && !(a < b && b < c))

double f(long long *e)
{
    double ans = 0;
    long long cnt = 0;
    for (long long n1 = 0; n1 < N; n1++) {
        for (long long n2 = n1+1; n2 < N; n2++) {
            long long tmp = 0;
            for (long long n3 = 0; n3 < n1; n3++) {
                if (is_kadomatu(e[n3], e[n1], e[n2])) {
                    tmp = std::max(tmp, std::max(e[n1], std::max(e[n2], e[n3])));
                }
            }
            for (long long n3 = n1+1; n3 < n2; n3++) {
                if (is_kadomatu(e[n1], e[n3], e[n2])) {
                    tmp = std::max(tmp, std::max(e[n1], std::max(e[n2], e[n3])));
                }
            }
            for (long long n3 = n2+1; n3 < N; n3++) {
                if (is_kadomatu(e[n1], e[n2], e[n3])) {
                    tmp = std::max(tmp, std::max(e[n1], std::max(e[n2], e[n3])));
                }
            }
            ans += tmp;
            cnt++;
        }
    }
    if (cnt == 0) return 0;
    return ans / cnt;
}

long long f()
{
    long long ans = 0;
    double k = 0;
    for (long long m = 0; m < M; m++) {
        double r = f(E[m]);
        if (r > k) {
            k = r;
            ans = m;
        }
    }
    return ans;
}

int main()
{
    std::cin >> N;
    std::cin >> M;
    for (long long m = 0; m < M; m++) {
        for (long long n = 0; n < N; n++) {
            std::cin >> E[m][n];
        }
    }
    std::cout << f() << std::endl;
    return 0;
}