a = input().split()
sorsz,sorh,szinek = int(a[0]),int(a[1]),int(a[2])


virags = []
tobblet = 0

mosth = 0
legh = 1

for i in range(sorsz):
    tomb = [0]*(szinek+1)
    sor = input().split()
    sor = [0] + sor
    virags.append(sor)
    for f in range(1,sorh+1):
        virags[i][f] = int(virags[i][f])
        if virags[i][f] == virags[i][f-1]:
            mosth += 1
        elif mosth > legh:
            legh = mosth
        tomb[virags[i][f]] += 1
        if tomb[virags[i][f]] > sorh / 2:
            tobblet += 1
            break

print(tobblet, legh, sep="\n")