#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7, P2 = 998244353, INF = 0x3f3f3f3f;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
  long long r = 1 % P;
  for (a %= P; n; a = a * a % P, n >>= 1)
    if (n & 1) r = r * a % P;
  return r;
}
long long inv(long long first) {
  return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
inline int rd() {
  int first = 0;
  char p = getchar();
  while (p < '0' || p > '9') p = getchar();
  while (p >= '0' && p <= '9') first = first * 10 + p - '0', p = getchar();
  return first;
}
const int N = 555;
int n, m, a[N][N], b[N][N];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) scanf("%d", a[i] + j);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) a[i][j] ^= rd();
  for (int i = 1; i <= n; ++i) {
    int sum = 0;
    for (int j = 1; j <= m; ++j)
      if (a[i][j]) {
        a[i + 1][j] ^= 1, ++sum;
      }
    if (sum & 1) return puts("No"), 0;
  }
  int sum = 0;
  for (int i = 1; i <= m; ++i) sum += a[n + 1][i];
  puts(sum ? "No" : "Yes");
}
