#include <iostream>
#include <algorithm>
using namespace std;
int main (){
    int r, s;
    cin >> r >> s;
    char polje[r][s];
    for (int i = 0; i < r; ++i){
        for (int j = 0; j < s; ++j){
            cin >> polje[i][j];
        }
    }
    int rez[9];
    for (int i = 0; i < r; ++i){
        for (int j = 0; j < s; ++j){
            if (polje[i][j] <= '9' && polje[i][j] > '0'){rez[polje[i][j] - 49] = j; break;}
        }
    }
    int pom = 1;
    int pom2 = 0;
    int rez2[9];
    for (int i = s; i > 0; --i){
        for (int j = 0; j < 9; ++j){
            pom2 = max (pom2, rez[j]);
        }
        if (pom2 == -1){break;}
        for (int j = 0; j < 9; ++j){
            if (rez[j] == pom2){rez2[j] = pom; rez[j] = -1;}
        }
        pom = pom + 1;
        pom2 = -1;
    }
    for (int i = 0; i < 9; ++i){
        cout << rez2[i] << endl;
    }
}