#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

int main()
{
    int n, m;
    cin >> n >> m;
    vector<vector<int> > r(n, vector<int>(m));
    for(int i=0; i<n; ++i){
        for(int j=0; j<m; ++j){
            cin >> r[i][j];
        }
    }

    vector<int> rMax(m, INT_MIN);
    vector<int> v(1<<m, 0);
    for(int i=0; i<n; ++i){
        bitset<10> bs, isUpdate;
        for(int j=0; j<m; ++j){
            if(rMax[j] < r[i][j]){
                rMax[j] = r[i][j];
                isUpdate[j] = true;
            }
            if(rMax[j] == r[i][j])
                bs[j] = true;
        }
        for(int j=0; j<(1<<m); ++j){
            int tmp = v[j];
            v[j] = 0;
            bitset<10> x(j);
            x &= ~isUpdate;
            v[x.to_ulong()] += tmp;
        }
        ++ v[bs.to_ulong()];

        int ans = i + 1 - v[0];
        cout << ans << endl;
    }

    return 0;
}