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.util.ArrayList;
import java.util.Scanner;

public class Main {
    public static ArrayList<Integer> group=new ArrayList<Integer>();
    public static ArrayList<ArrayList<Integer>> graph=new ArrayList<ArrayList<Integer>>();
    public static ArrayList<Integer> list=new ArrayList<Integer>();
    public static boolean[] arrb;
    public static void dfs(int v){
        arrb[v]=true;
        list.remove((Object) v);
        group.add(v);
        for (int i=0; i<graph.get(v).size(); i++){
            if (!arrb[graph.get(v).get(i)]) dfs(graph.get(v).get(i));
        }
    }

    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        String s=scanner.nextLine();
        String[] data=s.split(" ");
        int n=Integer.parseInt(data[0]);
        int m=Integer.parseInt(data[1]);
        boolean[][] map=new boolean[n][m];

        for (int i=0; i<n; i++){
            s=scanner.nextLine();
            char[] c=s.toCharArray();
            for (int j=0; j<m; j++){
                if (c[j]=='#') map[i][j]=true;
            }
        }
        int z=n+m;
        arrb=new boolean[z];
        for (int i=0; i<z; i++) list.add(i);
        for (int i=0; i<z; i++) graph.add(new ArrayList<Integer>());
        for (int i=0; i<n; i++){
            for (int j=0; j<m; j++){
                if (map[i][j]){
                    graph.get(i).add(j+n);
                    graph.get(j+n).add(i);
                }
            }
        }
        //System.out.println(graph);
        ArrayList<Integer> rows=new ArrayList<Integer>();
        ArrayList<Integer> cols=new ArrayList<Integer>();
        boolean b=true;
        while (list.size()>0){
            group.clear();
            rows.clear();
            cols.clear();
            dfs(list.get(0));
            for (int i=0; i<group.size(); i++){
                if (group.get(i)<n) rows.add(group.get(i)); else cols.add(group.get(i)-n);
            }
            //System.out.println(group);
            for (int i=0; i<rows.size(); i++){
                for (int j=0; j<cols.size(); j++){
                    if (!map[rows.get(i)][cols.get(j)]) b=false;
                }
            }
            //System.out.println(b);
        }
        if (b) System.out.println("Yes"); else System.out.println("No");
        scanner.close();
    }
}
