#include <cstdio>
#include <cstdlib>
#include <algorithm>

using namespace std;

int r,s;
char c;
int koji[100];
int pos[100];
pair <int,int> v[100];

bool func(pair <int,int> x, pair <int,int> y) {
	return x.second>y.second;
}

int main (void) {
	scanf("%d %d",&r,&s);
	for (int i=0;i<r;i++) {
		for (int j=0;j<s;j++) {
			scanf(" %c",&c);
			if (c>='1' && c<='9') {
				v[(c-48)]=make_pair((c-48),j);
				koji[i]=(c-48);
			}
		}
	}
	sort (v+1,v+10,func);
	int x=1;
	for (int i=1;i<=9;i++) {
		if (v[i].second!=v[i-1].second && i>1) x++;
		pos[v[i].first]=x;
	}
	for (int i=1;i<10;i++) {
		printf("%d\n",pos[i]);
	}
//	system("pause");
	return 0;
}
/*
10 10
S.....111F
S....222.F
S...333..F
S..444...F
S.555....F
S666.....F
S.777....F
S..888...F
S...999..F
S........F

10 15
S..........222F
S.....111.....F
S...333.......F
S...555.......F
S.......444...F
S.............F
S......777....F
S..888........F
S........999..F
S...666.......F
*/