/* monkukui 競技プログラミング用のテンプレート  (ここから) */
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
#include <bitset>

using namespace std;
using lint = long long int;
using ll = long long int;
using lnt = long long int;
using graph = vector<vector<int>>;
using wgraph = vector<vector<pair<int, long long int>>>;
long long int INF = 1001001001001001LL;
int inf = 100100100;
long long int MOD = 1000000007LL;
double PI = 3.1415926535897932;
long long int di[] = {-1, 0, 1, 0, -1, 1, 1, -1};
long long int dj[] = {0, 1, 0, -1, 1, 1, -1, -1};

template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
inline void yes(){ cout << "yes" << endl; }
inline void Yes(){ cout << "Yes" << endl; }
inline void YES(){ cout << "YES" << endl; }
inline void no(){ cout << "no" << endl; }
inline void No(){ cout << "No" << endl; }
inline void NO(){ cout << "NO" << endl; }
inline void possible(){ cout << "possible" << endl; }
inline void Possible(){ cout << "Possible" << endl; }
inline void POSSIBLE(){ cout << "POSSIBLE" << endl; }
inline void impossible(){ cout << "impossible" << endl; }
inline void Impossible(){ cout << "Impossible" << endl; }
inline void IMPOSSIBLE(){ cout << "IMPOSSIBLE" << endl; }

#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define drep(i,n) for(int i = (n)-1; i >= 0; i--)
#define srep(i,s,t) for(int i = s; i < t; i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back

/* monkukui 競技プログラミング用のテンプレート (ここまで)*/

int used[53][53][53][53];

int main(){
  
  while(1) {

    int h, w; cin >> h >> w;
    swap(h, w);
    if(h == 0) break;

    memset(used, 0, sizeof(used));

    vector<vector<int>> L(h + 2, vector<int> (w + 2, 0));
    vector<vector<int>> R(h + 2, vector<int> (w + 2, 0));
    
    int lsi, lsj, rsi, rsj, lgi, lgj, rgi, rgj;
    for(int i = 1; i <= h; i++) {
      for(int j = 1; j <= w; j++) {
        char c; cin >> c;
        if(c == '#') continue;
        L[i][j] = 1;
        if(c == 'L') {
          lsi = i;
          lsj = j;
        }
        if(c == '%') {
          lgi = i;
          lgj = j;
        }
      }

      for(int j = 1; j <= w; j++) {
        char c; cin >> c;
        if(c == '#') continue;
        R[i][j] = 1;
        if(c == 'R') {
          rsi = i;
          rsj = j;
        }
        if(c == '%') {
          rgi = i;
          rgj = j;
        }
      }
    }
    
    queue<pair<pair<int, int>, pair<int, int>>> q;
    q.push({{lsi, lsj},{rsi, rsj}});
    used[lsi][lsj][rsi][rsj] = 1;
    bool ok = false;
    while(!q.empty()) {


      auto hoge = q.front();
      q.pop();
      int li = hoge.first.first;
      int lj = hoge.first.second;
      int ri = hoge.second.first;
      int rj = hoge.second.second;
      
      if(li == lgi and lj == lgj and ri == rgi and rj == rgj) {
        ok = true;
        break;
      }

      for(int itr = 0; itr < 4; itr++) {
        // 壁なら進まない
        int nli = li + di[itr];
        int nlj = lj + dj[itr];
        int nri = ri + di[itr];
        int nrj = rj - dj[itr];

        if(L[nli][nlj] == 0) {
          nli = li;
          nlj = lj;
        }

        if(R[nri][nrj] == 0) {
          nri = ri;
          nrj = rj;
        }

        if(used[nli][nlj][nri][nrj]) continue;
        if((nli == lgi and nlj == lgj) ^ (nri == rgi and nrj == rgj)) continue;

        used[nli][nlj][nri][nrj] = 1;
        q.push({{nli, nlj}, {nri, nrj}});
      }
    }

    if(ok) Yes();
    else No();
  }
  return 0;
}



Measured memory_bytes: 34668