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.*;

public class Main {

	public static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader() {
			reader = new BufferedReader(new InputStreamReader(System.in), 32765);
			tokenizer = null;
		}

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(System.in), 32765);
			tokenizer = null;
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

		public char nextChar() {
			return next().charAt(0);
		}

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

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

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

		public int[] nextIntArr(int n) {
			int[] arr = new int[n];
			for (int i = 0; i < n; i++) {
				arr[i] = this.nextInt();
			}
			return arr;
		}

		public Integer[] nextIntegerArr(int n) {
			Integer[] arr = new Integer[n];
			for (int i = 0; i < n; i++) {
				arr[i] = new Integer(this.nextInt());
			}
			return arr;
		}

		public int[][] next2DIntArr(int n, int m) {
			int[][] arr = new int[n][m];
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < m; j++) {
					arr[i][j] = this.nextInt();
				}
			}
			return arr;
		}

		public int[] nextSortedIntArr(int n) {
			int[] arr = new int[n];
			for (int i = 0; i < n; i++) {
				arr[i] = this.nextInt();
			}
			Arrays.sort(arr);
			return arr;
		}

		public long[] nextLongArr(int n) {
			long[] arr = new long[n];
			for (int i = 0; i < n; i++) {
				arr[i] = this.nextLong();
			}
			return arr;
		}

		public long[] nextSortedLongArr(int n) {
			long[] arr = new long[n];
			for (int i = 0; i < n; i++) {
				arr[i] = this.nextInt();
			}
			Arrays.sort(arr);
			return arr;
		}

		public char[] nextCharArr(int n) {
			char[] arr = new char[n];
			for (int i = 0; i < n; i++) {
				arr[i] = this.nextChar();
			}
			return arr;
		}
	}

	public static InputReader scn = new InputReader();
	public static PrintWriter out = new PrintWriter(System.out);

	public static class Node {
		TreeSet<Integer> row, col;

		Node() {
			row = new TreeSet<>();
			col = new TreeSet<>();
		}
	}

	public static ArrayList<Node> list = new ArrayList<>();
	public static int n, m;

	public static void main(String[] args) {
		// InputStream inputStream = System.in; // Useful when taking input other than
		// console eg file handling // check ctor of inputReader
		// To print in file use this:- out = new PrintWriter("destination of file
		// including extension");
		n = scn.nextInt();
		m = scn.nextInt();

		int[][] arr = new int[n + 1][m + 1], clone = new int[n + 1][m + 1];

		for (int i = 1; i <= n; i++) {
			char[] s = (" " + scn.next()).toCharArray();
			for (int j = 1; j <= m; j++) {
				if (s[j] != '.') {
					clone[i][j] = arr[i][j] = 1;
				}
			}
		}

		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				if (arr[i][j] == 1) {
					Node n = new Node();
					for (int k = j; k <= m; k++) {
						if (arr[i][k] == 1) {
							n.col.add(k);
						}
					}
					funcC(arr, n.row, n.col);
					list.add(n);
				}
			}
		}

		int[] row = new int[n + 1];
		int[] col = new int[m + 1];

		for (int i = 0; i < list.size(); i++) {
			Node n = list.get(i);
			for (int r : n.row) {
				row[r]++;
			}
			for (int c : n.col) {
				col[c]++;
			}
		}

		boolean ans = true;

		for (int i = 1; i <= n && ans; i++) {
			for (int j = 1; j <= m && ans; j++) {
				if (arr[i][j] == 1) {
					ans = false;
				}
			}
		}

		for (Node k : list) {
			for (int r : k.row) {
				for (int c : k.col) {
					arr[r][c]++;
					if(arr[r][c] != clone[r][c]) {
						ans = false;
					}
				}
			}
		}

		if(ans) {
			System.out.println("Yes"); 
		} else {
			System.out.println("No");
		}
		
//		for (int i = 1; i <= n; i++) {
//			if (row[i] > 1) {
//				System.out.println("No");
//				return;
//			}
//		}
//
//		for (int i = 1; i <= m; i++) {
//			if (col[i] > 1) {
//				System.out.println("No");
//				return;
//			}
//		}
//
//		System.out.println("Yes");
	}

	public static void funcC(int[][] arr, TreeSet<Integer> row, TreeSet<Integer> col) {
		boolean change = false;
		for (int c : col) {
			for (int ii = 1; ii <= n; ii++) {
				if (arr[ii][c] == 1) {
					arr[ii][c] = 0;
					row.add(ii);
					change = true;
				}
			}
		}
		if (change) {
			funcR(arr, row, col);
		}
	}

	public static void funcR(int[][] arr, TreeSet<Integer> row, TreeSet<Integer> col) {
		boolean change = false;
		for (int r : row) {
			for (int jj = 1; jj <= m; jj++) {
				if (arr[r][jj] == 1) {
					arr[r][jj] = 0;
					col.add(jj);
					change = true;
				}
			}
		}
		if (change) {
			funcC(arr, row, col);
		}
	}
}
