// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<
constexpr int dx[] = { 1,0,-1,0 };
constexpr int dy[] = { 0,1,0,-1 };

int32_t main() {
    while (true) {
        int W,H; cin >> W >> H;
        if (W == 0 && H == 0) break;
        vector<string> L(H),R(H);
        rep (i,H) cin >> L[i] >> R[i], reverse(all(L[i]));
        auto inside = [&](int i, int j) {
            return (0 <= i && i < H &&
                    0 <= j && j < W);
        };
        auto valid_L = [&](int i, int j) {
            return inside(i,j) && L[i][j] != '#';
        };
        auto valid_R = [&](int i, int j) {
            return inside(i,j) && R[i][j] != '#';
        };

        int sxL = -1, syL = -1, sxR = -1, syR = -1;
        int gxL = -1, gyL = -1, gxR = -1, gyR = -1;
        rep (i,H) rep (j,W) {
            if (L[i][j] == 'L') sxL = i, syL = j;
            if (L[i][j] == '%') gxL = i, gyL = j;
            if (R[i][j] == 'R') sxR = i, syR = j;
            if (R[i][j] == '%') gxR = i, gyR = j;
        }

        auto d = make_v<int,4>(H,W,H,W,INF);
        queue<tuple<int,int,int,int>> q;
        d[sxL][syL][sxR][syR] = 0;
        q.emplace(sxL,syL,sxR,syR);
        while (q.size()) {
            auto t = q.front(); q.pop();
            int xL = get<0>(t);
            int yL = get<1>(t);
            int xR = get<2>(t);
            int yR = get<3>(t);
            rep (dir,4) {
                int nxL = xL+dx[dir];
                int nyL = yL+dy[dir];
                if (not valid_L(nxL,nyL)) nxL = xL, nyL = yL;
                int nxR = xR+dx[dir];
                int nyR = yR+dy[dir];
                if (not valid_R(nxR,nyR)) nxR = xR, nyR = yR;
                if ((L[nxL][nyL] == '%')^(R[nxR][nyR] == '%')) continue;
                if (chmin(d[nxL][nyL][nxR][nyR], d[xL][yL][xR][yR] + 1)) {
                    q.emplace(nxL,nyL,nxR,nyR);
                }
            }
        }
        cout << (d[gxL][gyL][gxR][gyR] < INF ? "Yes" : "No") << "\n";
    }
}



Measured memory_bytes: 57760