#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <limits>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;  // NOLINT
using P = pair<int, int>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
struct Inf { template<typename T> constexpr operator T() { return numeric_limits<T>::max() / 2; } };
// clang-format on

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int h, w;
    cin, h, w;
    auto mp = make_v(h, w, 0);
    rep(i, 0, h) {
        rep(j, 0, w) {
            char c;
            cin, c;
            int v = c == '#';
            v = (v + i + j) & 1;
            mp[i][j] = v;
        }
    }

    int m;
    cin, m;
    vector<bool> rows(h, false), columns(w, false);
    rep(i, 0, m) {
        int t, n;
        cin, t, n;
        if (t == 1) {
            rows[n - 1] = true;
        } else {
            columns[n - 1] = true;
        }
    }

    rep(i, 0, h - 1) {
        int count = 0;
        rep(j, 0, w) {
            count += mp[i][j] != mp[i + 1][j];
        }
        if (rows[i] && count == w) {
            rep(j, 0, w) {
                mp[i + 1][j] = 1 - mp[i + 1][j];
            }
        }
    }

    rep(j, 0, w - 1) {
        int count = 0;
        rep(i, 0, h) {
            count += mp[i][j] != mp[i][j + 1];
        }
        if (columns[j] && count == h) {
            rep(i, 0, h) {
                mp[i][j + 1] = 1 - mp[i][j + 1];
            }
        }
    }

    int count = 0;
    rep(i, 0, h) {
        rep(j, 0, w) {
            count += (2 * mp[i][j] - 1);
        }
    }
    print((count == w * h || count == -w * h) ? "Yes" : "No");

    return 0;
}