using System;
using System.Linq;

namespace Kert
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] inp = Console.ReadLine().Split().Select(int.Parse).ToArray();
            int[][] matrix = new int[inp[0]][];
            int dom = 0;
            int azonosmax = 0;
            for (int i = 0; i < inp[0]; i++)
            {
                matrix[i] = Console.ReadLine().Split().Select(int.Parse).ToArray();
                int most = matrix[i].GroupBy(x => x).Max(grp => grp.Count());
                if (most > inp[1] / 2)
                {
                    dom++;
                }
                int longest = 1;
                int current = 1;
                for (int j = 1; j < matrix[i].Length; j++)
                {
                    if (matrix[i][j] == matrix[i][j - 1])
                    {
                        current++;
                    }
                    else
                    {
                        longest = Math.Max(longest, current);
                        current = 1;
                    }
                }
                longest = Math.Max(longest, current);
                azonosmax = Math.Max(azonosmax, longest);
            }
            Console.WriteLine(dom);
            Console.WriteLine(azonosmax);
        }
    }
}