9 5
.....
#....
..#..
.....
.#..#
...#.
.#...
....#
.....
 4 10
..#......#
.....##...
#.........
.#.......#
 50 2
..
..
#.
..
.#
..
..
..
.#
..
..
.#
##
..
..
..
.#
..
..
.#
..
..
.#
..
..
.#
..
.#
..
.#
..
.#
.#
.#
..
..
..
.#
.#
.#
..
..
.#
.#
..
..
..
..
..
..
 2 50
...#.##.###...#.#..##....##..........#.#..#.#####.
...#.##.###...#.#..##....##..........#.#..#.#####.
 1 1
#
 3 3
.##
#.#
##.
 50 8
.....#..
........
........
.....#..
.....#..
........
........
........
........
...#....
...#....
........
...#....
#.#.#...
...#....
...#....
........
...#....
...#....
...#....
........
#.#.#...
.....#..
........
#.#.#...
#.#.#...
#.#.#...
...#....
........
........
........
#.#.#...
........
.....#..
........
........
........
........
........
........
.....#..
........
........
........
.....#..
#.#.#...
...#....
........
........
........
 1 1
.
 25 16
.............#..
.............#..
.......#...#....
............#...
.....#..........
.....#..........
#...............
................
........#.......
................
................
.#..............
#...............
.....#..........
.#..............
............#...
................
................
................
........#.......
..#.............
..........#.....
.......#...#....
.............#..
..........#.....
 25 16
..............#.
................
...#...#........
........#.#.....
..............##
..............#.
.......#........
......#.........
............#...
.........#.....#
..............#.
.......#........
#...........#...
...#.#..........
.#..............
................
......#.....#...
.......#........
........#.....#.
................
......#.........
..#.............
................
...#.#..........
.#..............
 10 15
.......#.......
.....#.........
....#..........
....#..........
.....#.........
.....#.........
#.............#
...#..#........
...............
.............#.
 4 10
###..#..##
...##..#..
.##..#..#.
.........#
 2 5
.####
#..##
 5 2
##
##
..
##
..
 2 2
##
#.
 50 1
.
.
#
.
#
.
#
.
.
#
#
#
.
#
#
#
#
.
.
.
.
.
.
.
.
.
#
#
#
#
.
.
.
.
.
#
.
.
.
#
#
.
.
#
#
.
.
#
#
.
 5 2
#.
##
##
#.
..
 2 3
#.#
###
 2 1
.
#
 2 3
#.#
##.
 10 10
..........
..........
..........
..........
.#.......#
#.........
......#...
..........
..........
#.....#...
 4 4
###.
##.#
#.##
.###

No
 No
 No
 Yes
 Yes
 No
 Yes
 Yes
 Yes
 No
 Yes
 No
 No
 Yes
 No
 Yes
 No
 No
 Yes
 No
 No
 No

import java.io.*;
import java.util.*;
import java.math.BigInteger;
import java.util.Map.Entry;

import static java.lang.Math.*;

public class A extends PrintWriter {

    void run() {
        int n = nextInt(), m = nextInt();

        boolean[][] b = new boolean[n][m];

        for (int i = 0; i < n; i++) {
            char[] str = next().toCharArray();
            for (int j = 0; j < m; j++) {
                b[i][j] = str[j] == '#';
            }
        }

        int[] sizeR = new int[n];
        int[][] listR = new int[n][m];

        int[] sizeC = new int[m];
        int[][] listC = new int[m][n];

        for (int r = 0; r < n; r++) {
            for (int c = 0; c < m; c++) {
                if (b[r][c]) {
                    listR[r][sizeR[r]++] = c;
                    listC[c][sizeC[c]++] = r;
                }
            }
        }

        boolean[][] a = new boolean[n][m];

        boolean[] useR = new boolean[n];
        boolean[] useC = new boolean[m];
        int[] qR = new int[n];
        int[] qC = new int[m];

        for (int r = 0; r < n; r++) {
            if (useR[r]) {
                continue;
            }

            for (int c = 0; c < m; c++) {
                if (useC[c]) {
                    continue;
                }

                if (b[r][c]) {
                    int hr = 0, tr = 0;
                    int hc = 0, tc = 0;

                    qR[hr++] = r;
                    qC[hc++] = c;

                    useC[c] = true;
                    useR[r] = true;

                    while (hr != tr || hc != tc) {
                        if (hr != tr) {
                            int pr = qR[tr++];

                            for (int id = sizeR[pr] - 1; id >= 0; id--) {
                                int pc = listR[pr][id];

                                if (useC[pc]) {
                                    continue;
                                }

                                useC[pc] = true;
                                qC[hc++] = pc;
                            }
                        }

                        if (hc != tc) {
                            int pc = qC[tc++];
                            for (int id = sizeC[pc] - 1; id >= 0; id--) {
                                int pr = listC[pc][id];

                                if (useR[pr]) {
                                    continue;
                                }

                                useR[pr] = true;
                                qR[hr++] = pr;
                            }
                        }
                    }

                    for (int rid = 0; rid < hr; rid++) {
                        for (int cid = 0; cid < hc; cid++) {
                            a[qR[rid]][qC[cid]] = true;
                        }
                    }
                }
            }
        }

        boolean ans = true;

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {

                ans &= a[i][j] == b[i][j];
            }
        }

        if (ans) {
            println("Yes");
        } else {
            println("No");

        }

    }

    boolean skip() {
        while (hasNext()) {
            next();
        }
        return true;
    }

    int[][] nextMatrix(int n, int m) {
        int[][] matrix = new int[n][m];
        for (int i = 0; i < n; i++)
            for (int j = 0; j < m; j++)
                matrix[i][j] = nextInt();
        return matrix;
    }

    String next() {
        while (!tokenizer.hasMoreTokens())
            tokenizer = new StringTokenizer(nextLine());
        return tokenizer.nextToken();
    }

    boolean hasNext() {
        while (!tokenizer.hasMoreTokens()) {
            String line = nextLine();
            if (line == null) {
                return false;
            }
            tokenizer = new StringTokenizer(line);
        }
        return true;
    }

    int[] nextArray(int n) {
        int[] array = new int[n];
        for (int i = 0; i < n; i++) {
            array[i] = nextInt();
        }
        return array;
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    String nextLine() {
        try {
            return reader.readLine();
        } catch (IOException err) {
            return null;
        }
    }

    public A(OutputStream outputStream) {
        super(outputStream);
    }

    static BufferedReader reader;
    static StringTokenizer tokenizer = new StringTokenizer("");
    static Random rnd = new Random();
    static boolean OJ;

    public static void main(String[] args) throws IOException {
        OJ = System.getProperty("ONLINE_JUDGE") != null;
        A solution = new A(System.out);
        if (OJ) {
            reader = new BufferedReader(new InputStreamReader(System.in));
            solution.run();
        } else {
            reader = new BufferedReader(new FileReader(new File(A.class.getName() + ".txt")));
            long timeout = System.currentTimeMillis();
            while (solution.hasNext()) {
                solution.run();
                solution.println();
                solution.println("----------------------------------");
            }
            solution.println("time: " + (System.currentTimeMillis() - timeout));
        }
        solution.close();
        reader.close();
    }
}