#include <iostream>
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <climits>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <numeric>
#include <functional>
#include <array>
#include <map>
#include <set>

#define INF 1000000007 //1000000000000000003
#define MOD 1000000007
#define MAX 2000005

#define ll long long

//printf("%.10f", );
//cout << fixed << setprecision(10) << heikin << endl;
//vector<vector<int>> data(3, vector<int>(4, -1));

using namespace std;
using P = pair<long long, long long>;
using T = tuple<int, int, int>;
using edge = struct { int to; long long dist; };
const double PI = 3.141592653589793;
long long fact[MAX], inv[MAX];
int dx[] = { -1,0,1,0 };
int dy[] = { 0,-1,0,1 };

//////////////////////////////////


struct BridgeInfo {
	int town1;
	int town2;
	int year;
	BridgeInfo(int t1, int t2, int y) {
		town1 = t1;
		town2 = t2;
		year = y;
	}
};

struct People {
	int index;
	int town;
	int year;
	People(int i, int t, int y) {
		index = i;
		town = t;
		year = y;
	}
};

bool compare_by_second(pair<int, int> a, pair<int, int> b) {
	if (a.second != b.second) {
		return a.second < b.second;
	}
	else {
		return a.first < b.first;
	}
}

struct UnionFind {
	vector<int>uf;
	
	UnionFind(int size) :uf(size, -1) {};

	int root(int target) {
		if (uf[target] < 0)return target;
		else return uf[target] = root(uf[target]);
	}

	void merge(int a, int b) {
		a = root(a);
		b = root(b);
		if (a == b)return;
		if (uf[b] < uf[a])swap(a, b);
		uf[a] += uf[b];
		uf[b] = a;
	}
};

ll CalcPow(ll num, ll power) {
	if (power == 0)return 1;
	if (power % 2 == 0) {
		ll half = CalcPow(num, power / 2);
		return (half * half) % MOD;
	}
	else return (num * CalcPow(num, power - 1)) % MOD;
}

ll combination(ll all, ll select) {
	if (all < select) return 0;
	if (all < 0 || select < 0) return 0;
	return fact[all] * (inv[select] * inv[all - select] % MOD) % MOD;
}

void initCombination(int max) {
	fact[0] = fact[1] = 1;
	for (int i = 2; i <= max; ++i) {
		fact[i] = fact[i-1] * i % MOD;
	}

	inv[max] = CalcPow(fact[max], MOD - 2);
	for (int i = max - 1; 0 <= i; --i) {
		inv[i] = (inv[i + 1] * (i + 1)) % MOD;
	}
}

int main() {
	int H,W,K;
	cin >> H >> W >> K;
	vector<string>cake(H);
	for (int i = 0; i < H;++i) {
		cin >> cake[i];
	}
	vector<vector<int>> ans(H, vector<int>(W, 0));
	//いちごの位置
	int tateMax = -1;  vector<int>yokoMax(H, -1);
	for (int i = 0; i < H;++i) {
		for (int j = 0; j < W;++j) {
			if (cake[i][j] == '#') {
				if (tateMax < i)tateMax = i;
				if (yokoMax[i] < j)yokoMax[i] = j;
			}
		}
	}
	//横
	int index = 1;
	for (int i = 0; i < H; ++i) {
		bool isExist = false;
		for (int j = 0; j < W; ++j) {
			if (cake[i][j] == '#') {
				isExist = true;
			}
			ans[i][j] = index;
		}
		if (isExist && i < tateMax)index++;
	}
	//縦
	index = 1;
	int stock = 0;
	map<int, int>m;
	for (int i = 0; i < H; ++i) {
		if (yokoMax[i] == -1 && i < tateMax) {
			stock++;
			continue;
		}
		for (int j = 0; j < W; ++j) {
			ans[i][j] = ans[i][j] * 1000 + index;
			m[ans[i][j]] = 0;
			if (stock != 0) {
				for (int k = 1; k <= stock; ++k) {
					ans[i - k][j] = ans[i - k][j] * 1000 + index;
				}
			}
			if (tateMax < i) {
				ans[i][j] = ans[i - 1][j];
			}
			if (cake[i][j] == '#' && j < yokoMax[i]) {
				index++;
			}
		}
		if (yokoMax[i] != -1 && stock != 0)stock = 0;
	}

	int count = 1;
	for (auto ma : m) {
		m[ma.first] = count;
		count++;
	}
	for (int i = 0; i < H; ++i) {
		for (int j = 0; j < W; ++j) {
			cout << m[ans[i][j]] << " ";
		}
		cout << endl;
	}
}

Measured memory_bytes: 5504