#include<bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(),x.end()
#define sz(x) (int)(x).size()
#define f first
#define s second
using namespace std;


int main(){
    int n,m;
    scanf("%i %i",&n,&m);
    vector<string> in(n),out(n);
    for(auto &p:in)cin>>p;
    for(auto &p:out)cin>>p;
    bool same=1;
    int cntx=0;
    for(int i=0;i<n;i++){
        if(in[i]!=out[i])same=0;
        for(auto p:in[i]){
            cntx+=p=='X';
        }
    }
    if(same){
        printf("1\n");
        return 0;
    }
    vector<int> cr(n),cc(m);
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(out[i][j]=='X'){
                cr[i]++;
                cc[j]++;
            }
        }
    }
    int cntOstali=0,cntxin=0,cntxout=0;
    vector<vector<bool>> bad(n,vector<bool>(m));
    queue<pair<int,int>> q;
    vector<bool> doner(n),donec(m);
    vector<bool> mustr(n),mustc(m);
    for(int i=0;i<n;i++){
        if(cr[i]>1){
            q.push({i,1});
            doner[i]=1;
        }
    }
    for(int i=0;i<m;i++){
        if(cc[i]>1){
            q.push({i,0});
            donec[i]=1;
        }
    }
    while(sz(q)){
        auto tr=q.front();
        q.pop();
        if(tr.s==1){
            int i=tr.f;
            if(mustr[i]){
                printf("0\n");
                return 0;
            }
            for(int j=0;j<m;j++){
                bad[i][j]=1;
                if(in[i][j]!=out[i][j]){
                    if(in[i][j]=='X'){
                        // Must hammer this column
                        mustc[j]=1;
                        if(donec[j]){
                            printf("0\n");
                            return 0;
                        }
                    }
                }
                if(out[i][j]=='X'){
                    if(in[i][j]=='O'){
                        printf("0\n");
                        return 0;
                    }
                    if(!doner[i]){
                        doner[i]=1;
                        q.push({i,1});
                    }
                    if(!donec[j]){
                        donec[j]=1;
                        q.push({j,0});
                    }
                }
            }
        }
        else{
            int j=tr.f;
            if(mustc[j]){
                printf("0\n");
                return 0;
            }
            for(int i=0;i<n;i++){
                bad[i][j]=1;
                if(in[i][j]!=out[i][j]){
                    if(in[i][j]=='X'){
                        // Must hammer this row
                        mustr[i]=1;
                        if(doner[i]){
                            printf("0\n");
                            return 0;
                        }
                    }
                }
                if(out[i][j]=='X'){
                    if(in[i][j]=='O'){
                        printf("0\n");
                        return 0;
                    }
                    if(!doner[i]){
                        doner[i]=1;
                        q.push({i,1});
                    }
                    if(!donec[j]){
                        donec[j]=1;
                        q.push({j,0});
                    }
                }
            }
        }
    }
    bool haveMust=0;
    for(int i=0;i<n;i++){
        if(mustr[i])haveMust=1;
    }
    for(int i=0;i<m;i++){
        if(mustc[i])haveMust=1;
    }

    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(bad[i][j]){
            }
            else{
                cntOstali++;
                if(in[i][j]=='X')cntxin++;
                if(out[i][j]=='X')cntxout++;
            }
        }
    }
    if(haveMust&&cntOstali==0){
        printf("0\n");
        return 0;
    }
    if(cntxout==0){
        printf("0\n");
        return 0;
    }
    if(cntxin==cntOstali){
        printf("0\n");
        return 0;
    }
    printf("1\n");
    return 0;
}