#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __Setup;

using ll = long long;
#define OVERLOAD3(_1, _2, _3, name, ...) name
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define REP1(i, n) for(int i = 0; i < int(n); i++)
#define REP2(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) ((int)(v).size())
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
constexpr int MOD2 = 998244353;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

void Case(int i) { cout << "Case #" << i << ": "; }
int popcount(int x) { return __builtin_popcount(x); }
ll popcount(ll x) { return __builtin_popcountll(x); }
#pragma endregion Macros

int main() {
    int H, W, M;
    cin >> H >> W;
    vector<string> s(H);
    REP(i, H) cin >> s[i];
    REP(i, H) REP(j, W) if((i + j) & 1) {
        s[i][j] = (s[i][j] == '#' ? '.' : '#');
    }
    cin >> M;
    vector<int> qs[2];
    REP(_, M) {
        int t, n;
        cin >> t >> n;
        t--;
        if((t == 0 and n == H) or (t == 1 and n == W)) continue;
        qs[t].emplace_back(n);
    }
    REP(i, 2) {
        qs[i].push_back(0);
        UNIQUE(qs[i]);
    }

    REP(i, H-1) {
        bool f = false;
        REP(j, W) if(s[i][j] != s[i+1][j]) {
            f = true;
            break;
        }
        if(f and !binary_search(ALL(qs[0]), i+1)) {
            cout << "No\n";
            return 0;
        }
    }
    REP(j, W-1) {
        bool f = false;
        REP(i, H) if(s[i][j] != s[i][j+1]) {
            f = true;
            break;
        }
        if(f and !binary_search(ALL(qs[1]), j+1)) {
            cout << "No\n";
            return 0;
        }
    }

    vector<string> t;
    for(int i : qs[0]) {
        string tmp = "";
        for(int j : qs[1]) tmp += s[i][j];
        t.push_back(tmp);
    }
    int h = SZ(t), w = SZ(t[0]);
    REP(i, h) if(t[i][0] == '#') {
        REP(j, w) t[i][j] = (t[i][j] == '#' ? '.' : '#');
    }
    REP(j, w) if(t[0][j] == '#') {
        REP(i, h) t[i][j] = (t[i][j] == '#' ? '.' : '#');
    }
    int cnt = 0;
    REP(i, h) REP(j, w) cnt += (t[i][j] != t[0][0]);
    cout << (cnt > 0 ? "No" : "Yes") << endl;
}