# include <cstdlib>
# include <vector>
# include <algorithm>
# include <iostream>

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

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

namespace khin::main::b {
  void main() {
    uint r, c; cin >> r >> c;
    vector<vector<char>> s(r, vector<char>(c));
    vector<vector<char>> t(r, vector<char>(c));
    for (auto& x : s) for (char& ch : x) cin >> ch;
    for (auto& x : t) for (char& ch : x) cin >> ch;
    if (r == c) return cout << 1 << endl, void();
    bool ok(false);
    for (auto& x : s)
      ok = ok || find(x.begin(), x.end(), 'O') != x.end();
    if (!ok) return cout << 0 << endl, void();
    vector<bool> era_r(r), era_c(c);
    for (uint i(0); i < r; ++i)
      if (count(t[i].begin(), t[i].end(), 'X') > 1)
        for (uint j(0); j < c; ++j) if (t[i][j] == 'X')
          era_c[j] = era_r[i] = true;
    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) for (uint j(0); j < r; ++j)
        if (t[j][i] == 'X') era_c[i] = era_r[j]= true;
    }
    for (uint i(0); i < r; ++i) if (era_r[i])
      if (s[i] != t[i]) return cout << 0 << endl, void();
    for (uint i(0); i < c; ++i) if (era_c[i])
      for (uint j(0); j < r; ++j) if (s[j][i] != t[j][i])
        return cout << 0 << endl, void();
    cout << 1 << endl;
  }
}