#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}



int main(){
    ll h,w;cin >> h >> w;
    vvl g(h,vl(w));
    rep(i,h){
        string s;cin >> s;
        rep(j,w)if(s[j]=='#')g[i][j]++;
    }
    rep(i,h)rep(j,w)if((i+j)&1)g[i][j]^=1;
    ll m;cin >> m;
    vl r,c;
    rep(i,m){
        ll t,a;cin >> t >> a;
        if(t==1)r.emplace_back(a);
        else c.emplace_back(a);
    }
    if(r.size()>c.size()){
        swap(r,c);
        vvl ng(w,vl(h));
        rep(i,h)rep(j,w)ng[j][i]=g[i][j];
        swap(ng,g);
        swap(h,w);
    }
    c.emplace_back(0);c.emplace_back(w);
    sort(all(r));sort(all(c));
    ll k=r.size();
    rep(bit,1<<k){
        vl cur(h);
        rep(d,k){
            if(bit>>d&1){
                rep(j,r[d])cur[j]^=1;
            }
        }
        auto ng=g;
        rep(i,h)rep(j,w)ng[i][j]^=cur[i];
        bool ok=true;
        vl comp(w,-1);
        rep(j,w){
            rep(i,h){
                if(comp[j]==-1){
                    comp[j]=ng[i][j];
                }
                else if(comp[j]!=ng[i][j])ok=false;
            }
        }
        if(ok==false)continue;
        rep(j,c.size()-1){
            ll fig=comp[c[j]];
            for(ll k=c[j];k<c[j+1];k++)if(fig!=comp[k])ok=false;
        }
        if(ok)cout << "Yes" << endl,exit(0);
    }
    cout << "No" << endl;
}