#include <bits/stdc++.h>
using namespace std;
template <class T>
int getbit(T s, int i) {
  return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
  return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
  return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
  return __builtin_popcount(s);
}
template <class T>
inline T gcd(T a, T b) {
  T r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long n, m, a[505][505], b[505][505], c[505][505];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m;
  for (long long i = 1, _b = n; i <= _b; i++)
    for (long long j = 1, _b = m; j <= _b; j++) cin >> a[i][j];
  for (long long i = 1, _b = n; i <= _b; i++)
    for (long long j = 1, _b = m; j <= _b; j++) cin >> b[i][j];
  for (long long i = 1, _b = n; i <= _b; i++) {
    for (long long j = 1, _b = m; j <= _b; j++) c[i][j] = (a[i][j] ^ b[i][j]);
  }
  for (long long i = 1, _b = n; i <= _b; i++) {
    long long dem = 0;
    for (long long j = 1, _b = m; j <= _b; j++) dem += c[i][j];
    if (dem & 1) {
      cout << "No";
      return 0;
    }
  }
  for (long long j = 1, _b = m; j <= _b; j++) {
    long long dem = 0;
    for (long long i = 1, _b = n; i <= _b; i++) dem += c[i][j];
    if (dem & 1) {
      cout << "No";
      return 0;
    }
  }
  cout << "Yes";
  return 0;
}
