#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int h, w;
  cin >> h >> w;
  vector<vector<char>> s(h, vector<char> (w));
  rep(i, h) rep(j, w) {
    char c;
    cin >> c;
    s[i][j] = (c == '#') ^ ((i ^ j) & 1);
  }
  bool ok = true;
  rep(i, h - 1) rep(j, w - 1) {
    if (s[i][j] ^ s[i+1][j] ^ s[i][j+1] ^ s[i+1][j+1]) {
      ok = false;
    }
  }
  vector<char> row(h), col(w);
  rep(i, h - 1) row[i] = s[i][0] ^ s[i+1][0];
  rep(j, w - 1) col[j] = s[0][j] ^ s[0][j+1];
  int m;
  cin >> m;
  rep(_, m) {
    int t, n;
    cin >> t >> n;
    (t == 1 ? row : col)[n - 1] = 0;
  }
  rep(i, h) ok &= !row[i];
  rep(j, w) ok &= !col[j];
  cout << (ok ? "Yes\n" : "No\n");
}