#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcountll(v)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
#define vector4d(type,name,h,w,d,...) vector<vector<vector<vector<type>>>>name(h,vector<vector<vector<type>>>(w,vector<vector<type>>(d,vector<type>(__VA_ARGS__))))
using namespace std;
using ll = long long;
template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=1LL<<60;
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}
template<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<'\n';}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){return (a+b-1)/b;}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}

//重み付きUnion_Find(XOR)
struct Weighted_dsu {
    public:
    Weighted_dsu() : _n(0) {}
    Weighted_dsu(int n) : _n(n), parent_or_size(n, -1),diff_weight(n,0) {}

    bool merge(int a, int b, int w) {
        int x = leader(a), y = leader(b);
        if(x==y){
            if(diff(a,b)==w)return true;
            return false;
        }
        w ^= diff_weight[a], w ^= diff_weight[b];
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        diff_weight[y] ^= w;
        return true;
    }
    int diff(int x, int y) {
        leader(x),leader(y);
        return diff_weight[y] ^ diff_weight[x];
    }
    bool same(int a, int b) {
        return leader(a) == leader(b);
    }
    int leader(int a) {
        if (parent_or_size[a] < 0) return a;
        int r = leader(parent_or_size[a]);
        diff_weight[a] ^= diff_weight[parent_or_size[a]];
        return parent_or_size[a] = r;
    }
    int size(int a) {
        return -parent_or_size[leader(a)];
    }
    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            std::remove_if(result.begin(), result.end(),
                           [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }
    private:
        int _n;
        std::vector<int> parent_or_size;
        std::vector<int> diff_weight;
};

template <size_t MAX_COL> struct BitMatrix{
    int H, W;
    vector<bitset<MAX_COL>> A;
    BitMatrix(int n) : H(n), W(MAX_COL), A(n) {}
    const bitset<MAX_COL>& operator[](int k) const { return A[k]; }
    bitset<MAX_COL>& operator[](int k) { return A[k]; }
    int gauss_jordan(bool extended = false) {
        int rank = 0;
        for(int j = 0; j < W - extended; j++) {
            int pivot = -1;
            for(int i = rank; i < H; i++) {
                if(A[i][j]){
                    pivot = i;
                    break;
                }
            }
            if(pivot==-1)continue;
            swap(A[pivot], A[rank]);
            for (int i = 0 ; i < H ; i++) {
                if (i != rank && A[i][j])A[i]^=A[rank];
            }
            rank++;
        }
        return rank;
    }
    pair<int, vector<int>> linear_equation(const vector<int>& b) {
        assert(H == (int)b.size());
        for (int i = 0; i < H; i++) A[i][W] = b[i];
        int rank = gauss_jordan(true);
        for (int i = rank; i < H; i++) {
            if (A[i][W]) return {-1, vector<int>{}};
        }
        vector<int> res(W, 0);
        for (int i = 0; i < rank; i++) res[i] = A[i][W];
        return {rank, res};
    }
    //N次正方行列について行列式を解く
    int Determinant(int N){
        assert(0 <= N && N <= H && N <= W);
        return (N == gauss_jordan() );
    }
};

int main(){
    INT(h,w);
    vector<string> A(h);
    in(A);
    INT(m);
    vector<pair<int,int>> b(m);
    rep(i,m){
        in(b[i].first,b[i].second);
    }
    Weighted_dsu uf1(h+w),uf2(h+w);
    bool f1 = true, f2 = true;
    for(int y=0;y<h;y++){
        for(int x=0;x<w;x++){
            if((y+x)&1){
                if(!uf1.merge(y,x+h,A[y][x]^'#'?1:0))f1 = false;
                if(!uf2.merge(y,x+h,A[y][x]^'#'?0:1))f2 = false;
            }else{
                if(!uf1.merge(y,x+h,A[y][x]^'#'?0:1))f1 = false;
                if(!uf2.merge(y,x+h,A[y][x]^'#'?1:0))f2 = false;
            }
        }
    }
    if(!f1 && !f2){
        out("No");
        return 0;
    }
    BitMatrix<400> E(h+w),F(h+w),G(h+w),H(h+w);
    for(int i=0;i<m;i++){
        if(b[i].first==1){
            for(int y=0;y<b[i].second;y++){
                E[y][i]=F[y][i]=G[y][i]=H[y][i]=1;
            }
        }else{
            for(int x=0;x<b[i].second;x++){
                E[x+h][i]=F[x+h][i]=G[x+h][i]=H[x+h][i]=1;
            }
        }
    }
    if(f1){
        vector<int> c(h+w);
        rep(i,h+w)c[i]=uf1.diff(0,i);
        if(E.linear_equation(c).first!=-1){
            out("Yes");
            return 0;
        }
        rep(i,h+w)c[i]^=1;
        if(F.linear_equation(c).first!=-1){
            out("Yes");
            return 0;
        }
    }
    if(f2){
        vector<int> c(h+w);
        rep(i,h+w)c[i]=uf2.diff(0,i);
        if(G.linear_equation(c).first!=-1){
            out("Yes");
            return 0;
        }
        rep(i,h+w)c[i]^=1;
        if(H.linear_equation(c).first!=-1){
            out("Yes");
            return 0;
        }
    }
    out("No");
}