class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1]*n
        self.rank = [0]*n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            return self.find(self.parents[x])

    def size(self, x):
        return -self.parents[self.find(x)]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.rank[x] < self.rank[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x
        if self.rank[x] == self.rank[y]:
            self.rank[x] += 1

    def root(self):
        return [i for i in range(self.n) if self.parents[i] < 0]


H, W = map(int, input().split())
S = [input() for _ in range(H)]
M = int(input())
A = [list(map(int, input().split())) for _ in range(M)]

X = [0]*H
Y = [0]*W
for i in range(H):
    for j in range(W):
        X[i] += int(S[i][j] == '#') << j
        Y[j] += int(S[i][j] == '#') << i

uf1 = UnionFind(H)
uf2 = UnionFind(W)
for i in range(H-1):
    v = X[i] ^ X[i+1]
    if v == (1 << W)-1:
        uf1.union(i, i+1)
    elif v:
        print('No')
        exit()
for i in range(W-1):
    v = Y[i] ^ Y[i+1]
    if v == (1 << H)-1:
        uf2.union(i, i+1)
    elif v:
        print('No')
        exit()

for t, n in A:
    if t == 1:
        if n < H:
            uf1.union(n-1, n)
    else:
        if n < W:
            uf2.union(n-1, n)

print('Yes' if uf1.size(0) == H and uf2.size(0) == W else 'No')