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<iostream>
#include<map>
#include<set>
#include<vector>
#include<string.h>

int con = 10000001;
std::vector<int> p;
std::vector<int> cl;
std::vector<int> ns;
int s=0;
std::set<int> flag_rows;
std::set<int> flag_columns;
int n;
int m;
int gotwo(int** mass, int or_, int row, int col){
    int i;
    int j;
    if (or_ == 1){
        for (j=0;j<m;j++){
            if (mass[row][j] == 1){
                mass[row][j] = 2;
                flag_columns.insert(j);
                if (gotwo(mass,0,row,j)==-1)
                    return -1;
            }
            if (mass[row][j]==0 and flag_columns.find(j)!=flag_columns.end())
                return -1;
        }
    }
    if (or_ == 0){
        for (i=0;i<n;i++){
            if (mass[i][col] == 1){
                mass[i][col] = 2;
                flag_rows.insert(i);
                if (gotwo(mass,1,i,col) == -1)
                    return -1;
            }
            if (mass[i][col]==0 and flag_rows.find(i)!=flag_rows.end())
                return -1;
        }
    }
    return 0;
}

int main()
{
    int i,j,k,l;

    char f;
    
    std::cin >> n;
    std::cin >> m;
    int** mass = new int*[n];
    for (i=0;i<n;i++)
        mass[i] = new int[m];
    for(i=0;i<n;i++){
        for (j=0;j<m;j++){
            std::cin >> f;
            if (f==' ')
                std::cin >> f;
            if (f == '.')
                mass[i][j] = 0;
            else
                mass[i][j] = 1;
        }
    }
    /*for(i=0;i<n;i++){
        for(j=0;j<m;j++){
            std::cout << mass[i][j] << " ";
        }
        std::cout << std::endl;
    }*/
    for(i=0;i<n;i++){
        //std::cout << i <<std::endl;
        for(j=0;j<m;j++){
            /*for(l=0;l<n;l++){
                for(k=0;k<m;k++){
                    std::cout << mass[l][k] << " ";
                }
                std::cout << std::endl;
            }*/
            if (mass[i][j]==1){
                if (gotwo(mass,1,i,j)==-1){
                    std::cout << "No" << std::endl;
                    return 0;
                }
                flag_columns.clear();
                flag_columns.clear();
                break;
                }
            }
            
        }
    
    
    std::cout << "Yes" << std::endl;
    return 0;
    
}
