# include <cstdlib>
# include <functional>
# include <cassert>
# include <vector>
# include <algorithm>
# include <numeric>
# include <iostream>
# include <ostream>

namespace khin {
  using namespace std;
  namespace main {
    inline namespace source {}
    namespace b { void main(); }
  }
}

int main() { khin::main::b::main(); }

namespace khin::main::b {
  constexpr uint r_max(1'000), c_max(1'000);
  class disjoint_set_union {
    uint mo[r_max + c_max + 1];
    uint sz[r_max + c_max + 1];
    public:
    constexpr disjoint_set_union() : mo{}, sz{} {
      iota(mo, mo + r_max + c_max + 1, 0u);
      fill(sz, sz + r_max + c_max + 1, 1u);
    }
    constexpr uint find(uint const x)
    { return mo[x] == x ? x : mo[x] = find(mo[x]); }
    constexpr void merge(uint x, uint y) {
      if ((x = find(x)) == (y = find(y))) return;
      if (sz[x] < sz[y]) swap(x, y);
      mo[y] = x, sz[x] += sz[y], sz[y] = 0;
    }
  };
  uint r, c; char s[r_max][c_max], t[r_max][c_max]; disjoint_set_union dsu;
  inline bool chkr(uint const x) { return dsu.find(x + 1) == dsu.find(0); }
  inline bool chkc(uint const x) { return dsu.find(x + r + 1) == dsu.find(0); }
  void main() {
    cin >> r >> c;
    for (uint i(0); i < r; ++i) for (uint j(0); j < c; ++j) cin >> s[i][j];
    for (uint i(0); i < r; ++i) for (uint j(0); j < c; ++j) cin >> t[i][j];
    bool const equal = [] {
      for (uint i(0); i < r; ++i) for (uint j(0); j < c; ++j)
        if (s[i][j] != t[i][j]) return false;
      return true;
    } ();
    if (equal) return cout << 1 << endl, void();
    for (uint i(0); i < r; ++i) for (uint j(0); j < c; ++j)
      if (t[i][j] == 'X') dsu.merge(i + 1, j + r + 1);
    for (uint i(0); i < r; ++i)
      if (count(t[i], t[i] + c, 'X') > 1) dsu.merge(i + 1, 0);
    for (uint i(0); i < c; ++i) {
      uint cnt(0);
      for (uint j(0); j < r; ++j) cnt += t[j][i] == 'X';
      if (cnt > 1) dsu.merge(i + r + 1, 0);
    }
    bool cso(false), csx(false), cto(false), ctx(false);
    for (uint i(0); i < r; ++i) for (uint j(0); j < c; ++j) {
      if (chkr(i) && chkc(j) && s[i][j] != t[i][j])
        return cout << 0 << endl, void();
      if (!chkr(i) && !chkc(j)) {
        cso = cso || s[i][j] == 'O', csx = csx || s[i][j] == 'X';
        cto = cto || t[i][j] == 'O', ctx = ctx || t[i][j] == 'X';
      }
    }
    if ((!cso && cto) || (!ctx && csx))
      return cout << 0 << endl, void();
    if (!cso || !ctx) {
      for (uint i(0); i < r; ++i) for (uint j(0); j < c; ++j)
        if ((chkr(i) || chkc(j)) && s[i][j] != t[i][j])
          return cout << 0 << endl, void();
      return cout << 1 << endl, void();
    }
    cout << 1 << endl;
  }
}