import sys def main(): input = sys.stdin.read().split() ptr = 0 N, M = int(input[ptr]), int(input[ptr+1]) ptr += 2 tickets = [] for _ in range(M): E = list(map(int, input[ptr:ptr+N])) ptr += N tickets.append(E) best_idx = 0 best_exp = -1.0 for idx, E in enumerate(tickets): max_prize = [[0]*(N+1) for _ in range(N+1)] for i in range(N): x = E[i] for j in range(i+1, N): y = E[j] for k in range(j+1, N): z = E[k] if x == y or y == z or x == z: continue sorted_vals = sorted([x, y, z]) sl = sorted_vals[1] if sl == x or sl == z: max_val = max(x, y, z) pairs = [(x, y), (x, z), (y, z)] for a, b in pairs: if a > b: a, b = b, a if max_val > max_prize[a][b]: max_prize[a][b] = max_val total_pairs = N * (N - 1) // 2 sum_val = 0 for a in range(1, N+1): for b in range(a+1, N+1): sum_val += max_prize[a][b] expected = sum_val / total_pairs if total_pairs > 0 else 0.0 if expected > best_exp or (expected == best_exp and idx < best_idx): best_exp = expected best_idx = idx print(best_idx) if __name__ == '__main__': main()