#include <cstdio>
#include <algorithm>
#include <utility>
#define MAX 110

using namespace std;
typedef pair < int, int > pii;

char str[MAX];
pii niz[10];
bool bio[10];
int output[10];
int n, m, k;

int main(void) {
	scanf("%d%d", &n, &m);
	for ( int i = 0; i < n; ++i ) {
		scanf("%s", str);
		for ( int j = 0; j < m; ++j ) {
			if ( str[j] >= '0' && str[j] <= '9' ) {
				int x = str[j] - '1';
				if ( bio[x] ) continue;
				bio[x] = true;
				niz[k] = pii( j, x );
				++k;
			}
		}
	}
	
	sort( niz, niz + k );
	
	int last = -1, tren = 0;
	for ( int i = 0; i < k; ++i ) {
		if ( niz[i].first != last ) {
			++tren;
			last = niz[i].first;
		}
		output[ niz[i].second ] = tren;
	}
	for ( int i = 0; i < k; ++i )
		printf("%d\n", tren + 1 - output[i] );
	return 0;
}