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>
using namespace std;
const long long LINF = 1e18;
const long long INF = 1e9;
const long long MOD = 10000007;
long long strtoll(string s) {
  stringstream str(s);
  long long number = 0;
  str >> number;
  return number;
}
string lltostr(long long n) {
  stringstream ss;
  ss << n;
  return ss.str();
}
long long power(long long a, long long b, long long m) {
  if (b == 0) return 1;
  if (b == 1) return a % m;
  long long t = power(a, b / 2, m);
  t = (t * t) % m;
  if (b & 1) t = (t * a) % m;
  return t;
}
long long llsqrt(long long x) {
  if (x == 0 || x == 1) return x;
  long long start = 1, end = x / 2, ans;
  while (start <= end) {
    long long mid = (start + end) / 2;
    if (mid * mid == x)
      return mid;
    else if (mid <= x / mid)
      ans = mid, start = mid + 1;
    else
      end = mid - 1;
  }
  return ans;
}
vector<long long> spf;
void sieve(long long size) {
  spf.resize(size + 1);
  for (long long i = 1; i <= size; ++i) spf[i] = i;
  for (long long i = 4; i <= size; i += 2) spf[i] = 2;
  for (long long i = 3; i * i <= size; ++i) {
    if (spf[i] == i) {
      for (long long j = i * i; j <= size; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long n, m;
  cin >> n >> m;
  vector<string> s;
  for (long long i = 0; i < n; i++) {
    string p;
    cin >> p;
    s.push_back(p);
  }
  for (long long i = 0; i < n; i++) {
    set<long long> ss;
    for (long long j = 0; j < m; j++) {
      if (s[i][j] == '#') ss.insert(j);
    }
    for (auto it = ss.begin(); it != ss.end(); it++) {
      long long c = *it;
      for (long long j = 0; j < n; j++) {
        if (s[j][c] == '#') {
          for (auto it1 = ss.begin(); it1 != ss.end(); it1++)
            if (s[j][*it1] == '#')
              continue;
            else {
              cout << "No";
              return 0;
            }
        }
      }
    }
  }
  cout << "Yes";
  return 0;
}
