using System;
using System.Linq;
using System.Collections.Generic;
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 = Console.ReadLine().Split().Select(int.Parse).ToList();
                int most = temp.GroupBy(i => i).OrderByDescending(grp => grp.Count()).First().Count();
                if (most > inp[1] / 2)
                {
                    dom++;
                }
                int longestSeriesCount = temp.Skip(1)
                             .Aggregate(new { Value = temp[0], Count = 1, Longest = new { Value = temp[0], Count = 1 } },
                                        (acc, x) => x == acc.Value ? new { Value = x, Count = acc.Count + 1, Longest = acc.Count + 1 > acc.Longest.Count ? new { Value = x, Count = acc.Count + 1 } : acc.Longest } :
                                                                   new { Value = x, Count = 1, Longest = acc.Longest })
                             .Longest.Count;
                if (longestSeriesCount > azonosmax)
                {
                    azonosmax = longestSeriesCount;
                }
            }
            Console.WriteLine(dom);
            Console.WriteLine(azonosmax);
        }
    }
}