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

#include <bits/stdc++.h>
int main() {
  int n, m;
  std::cin >> n >> m;
  std::vector<std::vector<int>> matrix(n, std::vector<int>(m));
  std::set<std::pair<size_t, size_t>> points;
  for (size_t x = 0; x < n; ++x) {
    for (size_t y = 0; y < m; ++y) {
      char cell;
      std::cin >> cell;
      matrix[x][y] = (cell == '#' ? 1 : 0);
      if (cell == '#') {
        points.insert({x, y});
      }
    }
  }
  std::vector<bool> x_used(n, false);
  std::vector<bool> y_used(m, false);
  while (!points.empty()) {
    auto element = points.begin();
    std::vector<size_t> xs;
    std::vector<size_t> ys;
    for (size_t x = 0; x < n; ++x) {
      if (matrix[x][element->second] == 1) {
        if (x != element->first && x_used[x]) {
          std::cout << "No" << std::endl;
          return 0;
        }
        x_used[x] = true;
        xs.push_back(x);
      }
    }
    for (size_t y = 0; y < m; ++y) {
      if (matrix[element->first][y] == 1) {
        if (y != element->second && y_used[y]) {
          std::cout << "No" << std::endl;
          return 0;
        }
        y_used[y] = true;
        ys.push_back(y);
      }
    }
    for (size_t x : xs) {
      for (size_t y : ys) {
        auto el = points.find({x, y});
        if (el == points.end()) {
          std::cout << "No" << std::endl;
          return 0;
        } else {
          points.erase({x, y});
        }
      }
    }
  }
  std::cout << "Yes" << std::endl;
  return 0;
}
