import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;

public class Main {
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        FastScanner sc = new FastScanner();
        Strategy strategy = new MyStrategy();
        strategy.solve(out, sc);
        out.flush();
    }
}

class MyStrategy implements Strategy {
    @Override
    public void solve(PrintWriter out, FastScanner sc) {
        int H = sc.nextInt();
        int W = sc.nextInt();
        int K = sc.nextInt();
        int[][] cakes = new int[H+1][W+1];
        int[][] result = new int[H+1][W+1];

        for (int i=0; i<=W; i++) {
            cakes[0][i] = -1;
        }

        for (int i=1; i<=H; i++) {
            int cnt = 0;
            String row = sc.next();
            for (int j=1; j<=W; j++) {
                char c = row.charAt(j-1);
                if (c == '#') {
                    cakes[i][j] = 1;
                    cnt++;
                } else {
                    cakes[i][j] = 0;
                }
            }
            cakes[i][0] = cnt;
        }

        int area = 0;
        List<Integer> notAssigned = new ArrayList<>();
        for (int i=1; i<=H; i++) {
            if (cakes[i][0] == 0) {
                notAssigned.add(i);
            } else {
                area++;
                result[i][1] = area;
                boolean appear = false;
                for (int non : notAssigned) {
                    result[non][1] = area;
                }
                if (cakes[i][1] == 1) {
                    appear = true;
                }
                for (int j=2; j<=W; j++) {
                    if (cakes[i][j] == 1) {
                        if (appear) {
                            area++;
                        }
                        appear = true;
                    }
                    result[i][j] = area;
                    for (int non : notAssigned) {
                        result[non][j] = area;
                    }
                }
                notAssigned.clear();
            }
        }


        if (notAssigned.size() > 0) {
            int assignedIdx = 0;
            for(int i=H; i>=0; i--) {
                if (cakes[i][0] > 0) {
                    assignedIdx = i;
                    break;
                }
            }
            for (int non : notAssigned) {
                for (int j=1; j<=W; j++) {
                    result[non][j] = result[assignedIdx][j];
                }
            }
        }
        StringBuilder sb = new StringBuilder();
        for (int i=1; i<=H; i++) {
            sb.append(result[i][1]);
            for (int j=2; j<=W; j++) {
                sb.append(" " + result[i][j]);
            }
            sb.append("\n");
        }
        out.println(sb.toString());
    }
}

interface Strategy {
    void solve(PrintWriter out, FastScanner sc);
}

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() { return Double.parseDouble(next());}
}


Measured memory_bytes: 44136