#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
void solve(){
int n, m;
cin >> n >> m;
vector<int> s(n), f(m);
for(int i = 0 ;i < n; i ++){
cin >> s[i];
}
for(int i = 0 ;i < m; i ++){
cin >> f[i];
}
vector<int> dist(m, 2e9);
int i = 0, j = 0;
while(i < n and j < m){
dist[j] = min(dist[j], abs(s[i] - f[j]));
if(i + 1 < n and s[i] < f[j]){
i++;
}
else if(j + 1 < m) {
j++;
dist[j] = min(dist[j], dist[j-1] + f[j] - f[j-1]);
}
else{
i++;
}
}
int ans = 0;
for (auto i : dist) {
ans = max(ans, i);
}
cout << ans << endl;
for(int i = 0; i < n; i += 3){
cout << "RLL";
}
cout << endl;
}
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ll tests = 1;
// cin >> tests;
for(ll i = 1; i <= tests; i++){
solve();
}
}
