#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define prArr(a) {cerr<<(#a)<<"={";int i=0;for(auto t:(a))cerr<<(i++?", ":"")<<t;cerr<<"}"<<endl;}
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){
  return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
//INSERT ABOVE HERE

Int D[51][51][51][51];
signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  while(1){
    Int W, H;
    cin>>W>>H;
    if(W == 0 && H == 0) break;
    vector<string> mp1(H), mp2(H);
    for(Int i=0;i<H;i++) cin>>mp1[i]>>mp2[i];

    Int sy1, sx1, sy2, sx2;
    for(Int i=0;i<H;i++)
      for(Int j=0;j<W;j++){
        if(mp1[i][j] == 'L') tie(sy1, sx1) = P(i, j);
        if(mp2[i][j] == 'R') tie(sy2, sx2) = P(i, j);
      }

    for(Int i=0;i<H;i++)
      for(Int j=0;j<W;j++)
        for(Int s=0;s<H;s++)
          for(Int t=0;t<W;t++) D[i][j][s][t] = INF;

    using T = tuple<Int, Int, Int, Int>;
    queue<T> Q;
    Q.emplace(sy1, sx1, sy2, sx2);
    D[sy1][sx1][sy2][sx2] = 0;

    string ans = "No";
    while(!Q.empty()){
      Int y1, x1, y2, x2;
      tie(y1, x1, y2, x2) = Q.front(); Q.pop();
      Int cost = D[y1][x1][y2][x2];

      if(mp1[y1][x1] == '%' && mp2[y2][x2] == '%'){ans = "Yes"; break;}
      if(mp1[y1][x1] == '%' || mp2[y2][x2] == '%') continue;
      const Int dx[] = {0, 1, 0, -1};
      const Int dy[] = {-1, 0, 1, 0};
      for(Int i=0;i<4;i++){
        Int ny1 = y1 + dy[i];
        Int nx1 = x1 + dx[i];
        Int ny2 = y2 + (i%2 == 0? dy[i]:dy[(i+2)%4]);
        Int nx2 = x2 + (i%2 == 0? dx[i]:dx[(i+2)%4]);
        Int ncost = cost + 1;
        if(ny1 < 0 || ny1 >= H || nx1 < 0 || nx1 >= W || mp1[ny1][nx1] == '#') tie(ny1, nx1) = P(y1, x1);
        if(ny2 < 0 || ny2 >= H || nx2 < 0 || nx2 >= W || mp2[ny2][nx2] == '#') tie(ny2, nx2) = P(y2, x2);
        if(D[ny1][nx1][ny2][nx2] <= ncost) continue;
        D[ny1][nx1][ny2][nx2] = ncost;
        Q.emplace(ny1, nx1, ny2, nx2);
      }
    }
    cout<<ans<<endl;
  }

  return 0;
}



Measured memory_bytes: 55832