#include <cstdio>
#include <algorithm>
using namespace std;

int
main(int argc, char *argv[])
{
    int n, m;
    scanf("%d %d", &n, &m);
    
    int r[100001][11];
    for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) scanf("%d", &r[i][j]);
    
    int Max[11], ol[1200] = {}, k, l, ans;
    for (int i = 0; i < n; i++) {
        k = l = 0;
        for (int j = 0; j < m; j++) {
            if (Max[j]  < r[i][j]) k += 1 << j, Max[j] = r[i][j];
            if (Max[j] == r[i][j]) l += 1 << j;
        }
        for (int j = 0; j < 1 << m; j++) {
            if ((j & k) != 0) ol[j - (j & k)] += ol[j], ol[j] = 0;
        }
        ol[k | l]++;
        ans = 0;
        for (int j = 1; j < 1 << m; j++) ans += ol[j];
        printf("%d\n", ans);
    }
    
    return 0;
    
}