////////////////////////////////////////
///  tu3 pro-con template            ///
////////////////////////////////////////
#include <cassert>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <functional>
#include <vector>
#include <queue>
#include <string>
#include <complex>
#include <stack>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <regex>
using namespace std;

//// MACRO ////
#define countof(a) (sizeof(a)/sizeof(a[0]))

#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i,s,n) for (int i = (s); i < (n); i++)
#define RFOR(i,s,n) for (int i = (n)-1; i >= (s); i--)
#define pos(c,i) c.being() + (i)
#define allof(c) c.begin(), c.end()
#define aallof(a) a, countof(a)
#define partof(c,i,n) c.begin() + (i), c.begin() + (i) + (n)
#define apartof(a,i,n) a + (i), a + (i) + (n)
#define long long long

#define EPS 1e-9
#define INF (1L << 30)
#define LINF (1LL << 60)

#define PREDICATE(t,a,exp) [&](const t & a) -> bool { return exp; }
#define COMPARISON_T(t) bool(*)(const t &, const t &)
#define COMPARISON(t,a,b,exp) [&](const t & a, const t & b) -> bool { return exp; }
#define CONVERTER(TSrc,t,TDest,exp) [&](const TSrc &t)->TDest { return exp; }

inline int sign(double x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }

//// i/o helper ////

struct _Reader { template <class T> _Reader operator ,(T &rhs) { cin >> rhs; return *this; } };
struct _Writer { bool f; _Writer() : f(false) { } template <class T> _Writer operator ,(const T &rhs) { cout << (f ? " " : "") << rhs; f = true; return *this; } };
#define READ(t,...) t __VA_ARGS__; _Reader(), __VA_ARGS__
#define WRITE(...) _Writer(), __VA_ARGS__; cout << endl

template <class T> struct vevector : public vector<vector<T>> { vevector(int n = 0, int m = 0, const T &initial = T()) : vector<vector<T>>(n, vector<T>(m, initial)) { } };
template <class T> struct vevevector : public vector<vevector<T>> { vevevector(int n = 0, int m = 0, int l = 0, const T &initial = T()) : vector<vevector<T>>(n, vevector<T>(m, l, initial)) { } };
template <class T> struct vevevevector : public vector<vevevector<T>> { vevevevector(int n = 0, int m = 0, int l = 0, int k = 0, const T &initial = T()) : vector<vevevector<T>>(n, vevevector<T>(m, l, k, initial)) { } };
template <class T> T read() { T t; cin >> t; return t; }
template <class T> vector<T> read(int n) { vector<T> v; REP(i, n) { v.push_back(read<T>()); } return v; }
template <class T> vevector<T> read(int n, int m) { vevector<T> v; REP(i, n) v.push_back(read<T>(m)); return v; }
template <class T> vevector<T> readjag() { return read<T>(read<int>()); }
template <class T> vevector<T> readjag(int n) { vevector<T> v; REP(i, n) v.push_back(readjag<T>()); return v; }

template <class T1, class T2> inline istream & operator >> (istream & in, pair<T1, T2> &p) { in >> p.first >> p.second; return in; }
template <class T1, class T2> inline ostream & operator << (ostream &out, pair<T1, T2> &p) { out << p.first << p.second; return out; }
template <class T> inline ostream & operator << (ostream &out, vector<T> &v)
{
	ostringstream ss;
	for (auto x : v) ss << x << ' ';
	auto s = ss.str();
	out << s.substr(0, s.length() - 1) << endl;
	return out;
}


//// start up ////
void solve();
int main()
{
	solve();
	return 0;
}


////////////////////
/// template end ///
////////////////////

void solve()
{
	int cases = INF;
	REP(_, cases)
	{
		READ(int, w, h);
		if (!w) { break; }
		vector<string> lmap, rmap;
		lmap.push_back(string(w + 2, '#'));
		rmap.push_back(string(w + 2, '#'));
		int lx, ly, rx, ry, Lx, Ly, Rx, Ry;
		REP(_, h)
		{
			READ(string, ls, rs);
			lmap.push_back("#" + ls + "#");
			rmap.push_back("#" + rs + "#");
			{ int p = ls.find_first_of('L'); if (p != ls.npos) { ly = _ + 1; lx = p + 1; } }
			{ int p = rs.find_first_of('R'); if (p != rs.npos) { ry = _ + 1; rx = p + 1; } }
			{ int p = ls.find_first_of('%'); if (p != ls.npos) { Ly = _ + 1; Lx = p + 1; } }
			{ int p = rs.find_first_of('%'); if (p != rs.npos) { Ry = _ + 1; Rx = p + 1; } }
		}
		lmap.push_back(string(w + 2, '#'));
		rmap.push_back(string(w + 2, '#'));
		w += 2; h += 2;

		vevevevector<bool> visited(w, h, w, h);
		struct status { int lx, ly, rx, ry, cost, h; };
		priority_queue<status, vector<status>, COMPARISON_T(status)> q(COMPARISON(status, a, b, a.cost + a.h > b.cost + b.h));
		int result = INF;
		const int dy[] = { 1, -1, 0, 0 }, dxl[] = { 0, 0, -1, 1 }, dxr[] = { 0, 0, 1, -1 };
		q.push({ lx, ly, rx, ry, 0, INF });
		while (!q.empty())
		{
			status s = q.top(); q.pop();
			if (visited[s.lx][s.ly][s.rx][s.ry]) continue;
			visited[s.lx][s.ly][s.rx][s.ry] = true;
			bool lok = s.lx == Lx && s.ly == Ly;
			bool rok = s.rx == Rx && s.ry == Ry;

			if (lok || rok) { if (lok && rok) { result = s.cost; break; } continue; }
			
			REP(i, 4)
			{
				int nlx = s.lx + dxl[i];
				int nly = s.ly + dy[i];
				int nrx = s.rx + dxr[i];
				int nry = s.ry + dy[i];
				int h = abs(Lx - nlx) + abs(Ly - nly) + abs(Ry - nry) + abs(Ry - nry);
				if (lmap[nly][nlx] == '#') { nlx = s.lx; nly = s.ly; }
				if (rmap[nry][nrx] == '#') { nrx = s.rx; nry = s.ry; }
				q.push({ nlx, nly, nrx, nry, s.cost + 1, h });
			}
		}
		WRITE(result != INF ? "Yes" : "No");
	}
}

Measured memory_bytes: 14408