#include <bits/stdc++.h>

using namespace std;

const int inf = 9999;

char m0[52][52];
char m1[52][52];
int d1[52][52];
int r,c;
int dt[52][52];

void debug_m0() {
    for(int i=0; i<r; ++i){
        for(int j=0; j<c; ++j) {
            cerr<<m0[i][j];
        }
        cerr<<endl;
    }
    cerr<<endl;
}

array<int,2> find_removeable(int li, int lj) {
    for(int i=0; i<r; ++i) {
        for(int j=0; j<c; ++j) {
            if(m0[i][j]=='*')dt[i][j]=inf;
            else dt[i][j]=-1;
        }
    }
    dt[li][lj]=0;
    queue<array<int,2> > q;
    q.push({li,lj});
    while(!q.empty()){
        int i = q.front()[0];
        int j = q.front()[1];
        li=i;
        lj=j;
        q.pop();
        if(i&&dt[i-1][j]>dt[i][j]+1) {
            dt[i-1][j]=dt[i][j]+1;
            q.push({i-1,j});
        }
        if(i+1<r&&dt[i+1][j]>dt[i][j]+1) {
            dt[i+1][j]=dt[i][j]+1;
            q.push({i+1,j});
        }
        if(j&&dt[i][j-1]>dt[i][j]+1) {
            dt[i][j-1]=dt[i][j]+1;
            q.push({i,j-1});
        }
        if(j+1<c&&dt[i][j+1]>dt[i][j]+1) {
            dt[i][j+1]=dt[i][j]+1;
            q.push({i,j+1});
        }
    }
    return {li,lj};
}
array<int,2> find_next(int li, int lj) {
    for(int i=0; i<r; ++i) {
        for(int j=0; j<c; ++j) {
            if(m0[i][j]=='*')dt[i][j]=inf;
            else dt[i][j]=-1;
        }
    }
    dt[li][lj]=0;
    queue<array<int,2> > q;
    q.push({li,lj});
    while(!q.empty()){
        int i = q.front()[0];
        int j = q.front()[1];
        q.pop();
        if(i&&dt[i-1][j]>dt[i][j]+1) {
            dt[i-1][j]=dt[i][j]+1;
            q.push({i-1,j});
        }
        if(i+1<r&&dt[i+1][j]>dt[i][j]+1) {
            dt[i+1][j]=dt[i][j]+1;
            q.push({i+1,j});
        }
        if(j&&dt[i][j-1]>dt[i][j]+1) {
            dt[i][j-1]=dt[i][j]+1;
            q.push({i,j-1});
        }
        if(j+1<c&&dt[i][j+1]>dt[i][j]+1) {
            dt[i][j+1]=dt[i][j]+1;
            q.push({i,j+1});
        }
    }

    for(int i=0; i<r; ++i) {
        for(int j=0; j<c; ++j) {
            if(m0[i][j]!='*')dt[i][j]=inf;
        }
    }


    int md=inf,mt=inf;
    array<int,2> ans = {-1,-1};
    for(int i=0; i<r; ++i) {
        for(int j=0; j<c; ++j) {
            int t = inf;
            if(m0[i][j]=='.') {
                if(i&&m0[i-1][j]=='*') t=dt[i-1][j];
                if(i+1<r && m0[i+1][j]=='*') t=dt[i+1][j];
                if(j&&m0[i][j-1]=='*') t=dt[i][j-1];
                if(j+1<c && m0[i][j+1]=='*') t=dt[i][j+1];
                if(t!=inf){
                    if(d1[i][j]<md) {
                        md=d1[i][j];
                        mt=t;
                        ans = {i,j};
                    } else if(d1[i][j]==md && t<mt) {
                        mt=t;
                        ans={i,j};
                    }
                }
            }
        }
    }
    return ans;
}
bool over() {
    for(int i=0; i<r; ++i) for(int j=0; j<c; ++j) if(m0[i][j]!=m1[i][j]) return 0;
    return 1;
}

int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    cin>>r>>c;
    for(int i=0; i<r; ++i) {
        string s;
        cin>>s;
        for(int j=0; j<c; ++j) {
            m0[i][j]=s[j];
        }
    }
    for(int i=0; i<r; ++i) {
        string s;
        cin>>s;
        for(int j=0; j<c; ++j) {
            m1[i][j]=s[j];
        }
    }
    queue<array<int,2> > q;
    for(int i=0; i<r; ++i) {
        for(int j=0; j<c; ++j) {
            if(m1[i][j]=='*') {
                d1[i][j]=0;
                q.push({i,j});
            } else if(m1[i][j]=='X') {
                d1[i][j]=-1;
            }
            else d1[i][j]=inf;
        }
    }
    while(!q.empty()) {
        int i = q.front()[0];
        int j = q.front()[1];
        q.pop();
        if(i&&d1[i-1][j]>d1[i][j]+1) {
            d1[i-1][j]=d1[i][j]+1;
            q.push({i-1,j});
        }
        if(i+1<r&&d1[i+1][j]>d1[i][j]+1) {
            d1[i+1][j]=d1[i][j]+1;
            q.push({i+1,j});
        }
        if(j&&d1[i][j-1]>d1[i][j]+1) {
            d1[i][j-1]=d1[i][j]+1;
            q.push({i,j-1});
        }
        if(j+1<c&&d1[i][j+1]>d1[i][j]+1) {
            d1[i][j+1]=d1[i][j]+1;
            q.push({i,j+1});
        }
    }
    for(int i=0; i<r; ++i) {
        for(int j=0; j<c; ++j) {
            if(m1[i][j]=='X') {
                d1[i][j]=inf;
            }
        }
    }


    int li=0,lj=0,tmd=inf;
    for(int i=0; i<r; ++i) {
        for(int j=0; j<c; ++j) {
            if(m0[i][j]=='*' && d1[i][j]<tmd) {
                tmd=d1[i][j];
                li=i;
                lj=j;
            }
        }
    }

    //cerr<<"lij: "<<li<<' '<<lj<<endl;
    if(tmd==inf) {
        cout<<"NO"<<endl;
        return 0;
    }

    vector<array<int,4> > ans;
    //debug_m0();
    while(1) {
        auto [ri,rj] = find_removeable(li,lj);
        if(over()) break;
        m0[ri][rj]='.';
        //debug_m0();
        auto [ai,aj] = find_next(li,lj);
        m0[ai][aj]='*';
        //debug_m0();
        ans.push_back({ri,rj,ai,aj});
        li=ai;
        lj=aj;
    }
    cout<<"YES\n";
    cout<<ans.size()<<'\n';
    for(auto &x:ans) {
        cout<<x[0]+1<<' '<<x[1]+1<<' '<<x[2]+1<<' '<<x[3]+1<<'\n';
    }

    return 0;
}