#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#include <cassert>


using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<n;++i)
#define FOR(i, a, b) for(int i=a;i<b;++i)
#define RREP(i, n) for(int i=n-1;i>=0;--i)
#define RFOR(i, a, b) for(int i=b-1;i>=a;--i)

#define all(x) begin(x),end(x)
#define dump(x) cerr<<#x<<" = "<<(x)<<endl
#define debug(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<int, int>;
const double eps = 1e-8;
const ll MOD = 1000000007;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}


template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> p) {
    os << p.first << ":" << p.second;
    return os;
}

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

template<class T1, class T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
    os << "[";
    for (auto it = mp.begin(); it != mp.end(); ++it) {
        if (it != mp.begin()) {
            os << ", ";
        }
        os << *it;
    }
    return os << "]";
}

// edit

void inner(int L, int &M, int R) {
    if (L > M) M = L;
    if (R < M) M = R;
}

bool solve() {
    int H, W;
    cin >> W >> H;
    if (W == 0 && H == 0) return false;

    vector<string> fieldL(H), fieldR(H);

    REP(i, H) {
        cin >> fieldL[i] >> fieldR[i];
    }

    int sLh, sLw, sRh, sRw;
    for (int i = 0; i < H; ++i) {
        for (int j = 0; j < W; ++j) {
            if (fieldL[i][j] == 'L') {
                sLh = i;
                sLw = j;
            }

            if (fieldR[i][j] == 'R') {
                sRh = i;
                sRw = j;
            }
        }
    }

    using tup = tuple<int, int, int, int>;
    queue<tup> que;
    que.push(tup(sLh, sLw, sRh, sRw));

    bool used[50][50][50][50] = {};
    used[sLh][sLw][sRh][sRw] = true;

    while (!que.empty()) {
        int dh[] = {0, -1, 0, 1};
        int dLw[] = {1, 0, -1, 0};
        int dRw[] = {-1, 0, 1, 0};
        int Lh, Lw, Rh, Rw;
        tie(Lh, Lw, Rh, Rw) = que.front();
        que.pop();
        if (fieldL[Lh][Lw] == '%' && fieldR[Rh][Rw] == '%') {
            cout << "Yes" << endl;
            return true;
        } else if (fieldL[Lh][Lw] == '%' || fieldR[Rh][Rw] == '%') {
            continue;
        }

        for (int k = 0; k < 4; ++k) {
            int nLh = Lh + dh[k];
            int nLw = Lw + dLw[k];
            int nRh = Rh + dh[k];
            int nRw = Rw + dRw[k];
            inner(0, nLh, H - 1);
            inner(0, nLw, W - 1);
            inner(0, nRh, H - 1);
            inner(0, nRw, W - 1);
            if (fieldL[nLh][nLw] == '#') {
                nLh = Lh;
                nLw = Lw;
            }
            if (fieldR[nRh][nRw] == '#') {
                nRh = Rh;
                nRw = Rw;
            }
            if (!used[nLh][nLw][nRh][nRw]) {
                used[nLh][nLw][nRh][nRw] = true;
                que.push(tup(nLh, nLw, nRh, nRw));
            }
        }
    }

    cout << "No" << endl;
    return true;
}


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
//    std::ifstream in("input.txt");
//    std::cin.rdbuf(in.rdbuf());

    while (solve());


    return 0;
}



Measured memory_bytes: 10060