using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        var r = NArr(n);
        var maxval = new int[m][];
        for (var i = 0; i < m; ++i) maxval[i] = new int[n + 1];
        for (var i = 0; i < n; ++i)
        {
            for (var j = 0; j < m; ++j)
            {
                maxval[j][i + 1] = Math.Max(r[i][j], maxval[j][i]);
            }
        }
        var ans = new int[n];
        for (var i = 0; i < n; ++i)
        {
            var start = i;
            var end = i;
            for (var j = 0; j < m; ++j)
            {
                if (maxval[j][i + 1] == r[i][j])
                {
                    end = Math.Max(end, LowerBound(i + 1, r[i][j] + 1, maxval[j]) - 1);
                }
            }
            if (i > 0) ans[i] += ans[i - 1];
            ++ans[start];
            if (end < n) --ans[end];
        }
        WriteLine(string.Join("\n", ans));
    }
    static int LowerBound(int left, int min, IList<int> list)
    {
        if (list[left] >= min) return left;
        var ng = left;
        var ok = list.Count;
        while (ok - ng > 1)
        {
            var mid = (ng + ok) / 2;
            if (list[mid] < min) ng = mid;
            else ok = mid;
        }
        return ok;
    }
}