uva10564

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
long long int dp[45][45][505],v[45][25],n,s;

int main()
{
	while (cin >> n >> s && (n + s)) {
		memset(dp, 0, sizeof(dp));
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n - i + 1; j++)
				cin >> v[i][j];

		for (int i = n + 1; i < 2 * n; i++)
			for (int j = 1; j <= i - n + 1; j++)
				cin >> v[i][j];
		for (int i = 1; i <= n; i++) dp[(n << 1) - 1][i][v[(n << 1) - 1][i]] = 1;

		for (int i = 2 * n - 2; i >= n; i--)
			for (int j = 1; j <= i - n + 1; j++)
				for (int k = v[i][j]; k <= s; k++)
					dp[i][j][k] = dp[i + 1][j][k - v[i][j]] + dp[i + 1][j + 1][k - v[i][j]];
		
		for (int i = n - 1; i >= 1; i--)
			for (int j = 1; j <= n - i + 1; j++)
				for (int k = v[i][j]; k <= s; k++)
					dp[i][j][k] = dp[i + 1][j - 1][k - v[i][j]] + dp[i + 1][j][k - v[i][j]];

		long long int pos = -1, ans = 0;
		for (int i = 1; i <= n; i++) {
			if (dp[1][i][s]) {
				ans += dp[1][i][s];
				if (pos == -1)pos = i;
			}
		}

		if (pos == -1) {
			cout << 0 << endl << endl;
			continue;
		}
		cout << ans << endl << pos - 1 << " ";
		for (int i = 1; i < n; i++) {
			s -= v[i][pos];
			if (dp[i + 1][pos - 1][s]) {
				cout << 'L';
				pos--;
			}
			else cout << 'R';
		}
		for (int i = n; i < 2 * n - 1; i++) { //i+n-1
			s -= v[i][pos];
			if (dp[i + 1][pos][s]) cout << 'L';
			else {
				cout << 'R';
				pos++;
			}
		}
		cout << endl;
	}
	return 0;
}