#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll=long long;
using vi=vector<int>;
using vl=vector<long long>;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
#define ITR(i,c) for(auto i=begin(c);i!=end(c);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define REPW(i,n) for(i=0;i<(int)(n);++i)
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)   // c++14
#define SZ(c) ((int)c.size())
#define EXIST(c,x) (c.find(x)!=end(c))
#define OUTOFRANGE(y,x,h,w) (y<0||x<0||y>=h||x>=w)
#define dump(...)
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
#define INF (1001001001)
#define INFLL (1001001001001001001ll)
template<class T> ostream& operator << (ostream &os,const vector<T> &v) {
    ITR(i,v) os << *i << (i==end(v)-1 ? "" : " "); return os; }
template<class T> istream& operator >> (istream &is,vector<T> &v) {
    ITR(i,v) is >> * i; return is; }
template<class T> istream& operator >> (istream &is, pair<T,T> &p) {
        is >> p.first >> p.second; return is; }
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
//------------------------------------------------------------------------------
struct before_main_function {
    before_main_function() {
        #ifdef int
            #undef INF
            #define INF INFLL
            #define stoi stoll
        #endif
        cin.tie(0);ios::sync_with_stdio(false);
        cout<<setprecision(15)<<fixed;
    }
} before_main_function;
//------------------------------------------------------------------------------

int W,H,asx,asy,bsx,bsy,agx,agy,bgx,bgy;
bool dp[50][50][50][50];
char a[50][50],b[50][50];
void solve() {
    REP(i,50) REP(j,50) REP(k,50) REP(l,50) dp[i][j][k][l]=false;

    REP(i,H) {
        REP(j,W) cin>>a[i][j];
        REP(j,W) cin>>b[i][W-j-1];
        REP(j,W) {
            if(a[i][j]=='L') asy=i,asx=j;
            if(b[i][j]=='R') bsy=i,bsx=j;
            if(a[i][j]=='%') agy=i,agx=j;
            if(b[i][j]=='%') bgy=i,bgx=j;
        }
    }

    queue<pair<pii,pii>> q;
    q.push({{asy,asx},{bsy,bsx}});
    dp[asy][asx][bsy][bsx]=true;
    while(!q.empty()) {
        int y1=q.front().first.first;
        int x1=q.front().first.second;
        int y2=q.front().second.first;
        int x2=q.front().second.second;
        q.pop();

        if(y1==agy && x1==agx && y2==bgy && x2==bgx) {
            cout<<"Yes"<<endl;
            return;
        }

        REP(d,4) {
            int ny1=y1+DY[d];
            int nx1=x1+DX[d];
            int ny2=y2+DY[d];
            int nx2=x2+DX[d];
            if(OUTOFRANGE(ny1,nx1,H,W) || a[ny1][nx1]=='#') {
                ny1=y1;
                nx1=x1;
            }
            if(OUTOFRANGE(ny2,nx2,H,W) || b[ny2][nx2]=='#') {
                ny2=y2;
                nx2=x2;
            }
            if(dp[ny1][nx1][ny2][nx2]) continue;
            if((ny1==agy && nx1==agx) && !(ny2==bgy && nx2==bgx)) continue;
            if(!(ny1==agy && nx1==agx) && (ny2==bgy && nx2==bgx)) continue;
            dp[ny1][nx1][ny2][nx2]=true;
            q.push({{ny1,nx1},{ny2,nx2}});
        }
    }
    cout<<"No"<<endl;
}
signed main() {
    while(1!=2) {
        cin>>W>>H;
        if(W+H==0) break;
        solve();
    }
    return 0;
}

Measured memory_bytes: 10960