import std.stdio, std.conv, std.string, std.array, std.range, std.algorithm, std.container;
import std.math, std.random, std.bigint, std.datetime, std.format;
void main(string[] args){ if(args.length > 1) if(args[1] == "-debug") DEBUG = 1; solve(); }
void log()(){ writeln(""); } void log(T, A ...)(T t, lazy A a){ if(DEBUG) write(t, " "), log(a); } bool DEBUG = 0; 
string rstring(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
T rtype(T)(){ return rstring.to!T; } alias rint = rtype!int, rlong = rtype!long, rreal = rtype!real;
T[] rtypes(T)(int n){ return n.iota.map!(i => rtype!T()).array; } alias rint = rtypes!int, rlong = rtypes!long, rreal = rtypes!real;
T[][] rtypess(T)(int n, int m){ return n.iota.map!(i => rtypes!T(m)).array; } alias rint = rtypess!int, rlong = rtypess!long, rreal = rtypess!real;

// ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- //

void solve(){
	int h = rint, w = rint, k = rint;
	
	bool[][] xf;
	foreach(i; 0 .. h){
		xf ~= readln.chomp.to!(char[]).map!(x => x == '#').array;
	}
	
	bool[] has = new bool[](h);
	foreach(i; 0 .. h) foreach(j; 0 .. w) if(xf[i][j]) has[i] = 1;
	
	int[][] ans = new int[][](h, w);
	int c = 0;
	foreach(i; 0 .. h){
		if(!has[i]) continue;
		bool f = 0;
		c += 1;
		foreach(j; 0 .. w){
			if(xf[i][j]){
				if(f != 0) c += 1;
				 f = 1;
			 }
			ans[i][j] = c;
		}
	}
	int[] rs = new int[](h);
A:	foreach(i; 0 .. h){
		if(has[i]) continue;
		foreach(i2; i .. h) if(has[i2]){
			rs[i] = i2;
			continue A;
		}
		foreach_reverse(i2; 0 .. i) if(has[i2]){
			rs[i] = i2;
			continue A;
		}
	}
	
	foreach(i; 0 .. h){
		if(has[i]) continue;
		foreach(j; 0 .. w) ans[i][j] = ans[rs[i]][j];
	}
	
	foreach(i; 0 .. h){
		ans[i].map!(to!string).array.join(" ").writeln;
		}
}
