#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

template <typename T>
std::vector<std::vector<T>> rotate(const std::vector<std::vector<T>>& grid,
                                   const int angle, const T space = ' ') {
  const int h = grid.size(), w = grid.front().size();
  std::vector<std::vector<T>> rotated_grid;
  if (angle == 45) {
    rotated_grid.assign(h + w - 1, std::vector<T>(h + w - 1, space));
    for (int i = 0; i < h; ++i) {
      for (int j = 0; j < w; ++j) {
        rotated_grid[i + j][i - j + w - 1] = grid[i][j];
      }
    }
  } else if (angle == 90) {
    rotated_grid.assign(w, std::vector<T>(h));
    for (int i = 0; i < h; ++i) {
      for (int j = 0; j < w; ++j) {
        rotated_grid[w - 1 - j][i] = grid[i][j];
      }
    }
  } else {
    assert(false);
  }
  return rotated_grid;
}

int main() {
  int h, w; cin >> h >> w;
  vector s(h, vector(w, '.')); REP(i, h) REP(j, w) cin >> s[i][j];
  int m; cin >> m;
  vector<int> n[2]{vector<int>(h, false), vector<int>(w, false)};
  while (m--) {
    int t, n_i; cin >> t >> n_i; --t; --n_i;
    n[t][n_i] = true;
  }
  REP(_, 2) {
    for (int i = h - 2; i >= 0; --i) {
      if (s[i].front() == s[i + 1].front()) {
        if (s[i] != s[i + 1] || !n[0][i]) {
          cout << "No\n";
          return 0;
        }
      } else {
        REP(j, w) {
          if (s[i][j] == s[i + 1][j]) {
            cout << "No\n";
            return 0;
          }
        }
      }
    }
    swap(h, w);
    swap(n[0], n[1]);
    s = rotate(rotate(rotate(s, 90), 90), 90);
  }
  cout << "Yes\n";
  return 0;
}