#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10, M = 4e6 + 10, inf = 1e9 + 10, mod = 1e9 + 7;
const long long INF = 1e18 + 10;
int a[N], sum[N];
int ans[N];
struct is {
  int l, r;
} p[N];
int check(int l, int r) {
  if (l == r) return 1;
  int maxx = 0;
  for (int i = l; i <= r; i++) maxx = max(maxx, a[i]);
  for (int i = l; i <= r; i++) {
    if (a[i] == maxx && i == l && a[i] > a[i + 1]) {
      return 1;
    } else if (a[i] == maxx && i == r && a[i] > a[i - 1]) {
      return 1;
    } else if (l != i && r != i && a[i] == maxx &&
               (a[i] > a[i + 1] || a[i] > a[i - 1])) {
      return 1;
    }
  }
  return 0;
}
void getans(int l, int len, int n) {
  int maxx = 0;
  for (int i = l; i <= l + len - 1; i++) maxx = max(maxx, a[i]);
  while (len != 1) {
    for (int i = l; i <= l + len - 1; i++) {
      if (i == l && a[i] >= maxx && a[i] > a[i + 1]) {
        printf("%d R\n", i);
        a[i] += a[i + 1];
        maxx = max(maxx, a[i]);
        for (int j = i + 1; j <= n; j++) a[j] = a[j + 1];
        break;
      }
      if (i == l + len - 1 && a[i] >= maxx && a[i] > a[i - 1]) {
        printf("%d L\n", i);
        a[i - 1] += a[i];
        maxx = max(a[i - 1], maxx);
        for (int j = i; j <= n; j++) a[j] = a[j + 1];
        break;
      }
      if (i != l + len - 1 && i != l && a[i] >= maxx && a[i] > a[i + 1]) {
        printf("%d R\n", i);
        a[i] += a[i + 1];
        maxx = max(a[i], maxx);
        for (int j = i + 1; j <= n; j++) a[j] = a[j + 1];
        break;
      }
      if (i != l + len - 1 && i != l && a[i] >= maxx && a[i] > a[i - 1]) {
        printf("%d L\n", i);
        a[i - 1] += a[i];
        maxx = max(a[i - 1], maxx);
        for (int j = i; j <= n; j++) a[j] = a[j + 1];
        break;
      }
    }
    len--;
  }
}
int main() {
  int n, m;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]), sum[i] = sum[i - 1] + a[i];
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) scanf("%d", &ans[i]);
  int pre = 0;
  int hh = 0;
  for (int i = 1; i <= m; i++) {
    for (int j = pre + 1; j <= n; j++) {
      if (sum[j] - sum[pre] == ans[i]) {
        p[hh].l = pre + 1;
        p[hh++].r = j;
        pre = j;
        break;
      }
    }
  }
  if (hh != m || p[hh - 1].r != n) return puts("NO\n");
  for (int i = 0; i < hh; i++) {
    if (check(p[i].l, p[i].r) == 0) return puts("NO\n");
  }
  printf("YES\n");
  for (int i = 0; i < m; i++) getans(i + 1, p[i].r - p[i].l + 1, n);
  return 0;
}
