using System;
using System.Collections.Generic;
using System.Linq;

namespace Kert
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] inp = Console.ReadLine().Split().Select(int.Parse).ToArray();
            List<int> temp = new List<int>();
            int dom = 0;
            int azonosmax = 0;
            for (int u = 0; u < inp[0]; u++)
            {
                temp.Clear();
                temp.AddRange(Console.ReadLine().Split().Select(int.Parse));
                int most = temp.GroupBy(i => i)
                    .OrderByDescending(grp => grp.Count())
                    .First()
                    .Count();
                if (most > inp[1] / 2)
                {
                    dom++;
                }
                int longest = 1;
                int current = 1;
                for (int i = 1; i < temp.Count; i++)
                {
                    if (temp[i] == temp[i - 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);
        }
    }
}