#include <bits/stdc++.h>
using namespace std;
inline long long int modadd(long long int n, long long int m,
                            long long int p = 1000000007) {
  return ((n + m) % p + p) % p;
}
inline long long int modsub(long long int n, long long int m,
                            long long int p = 1000000007) {
  return ((n - m + p) % p + p) % p;
}
inline long long int modpro(long long int n, long long int m,
                            long long int p = 1000000007) {
  return (((n % p) * (m % p)) % p + p) % p;
}
unsigned long long int powe(long long int first, long long int second) {
  unsigned long long int res = 1;
  while (second > 0) {
    if (second & 1) res = res * first;
    second = second >> 1;
    first = first * first;
  }
  return res;
}
long long int modpow(long long int first, long long int second,
                     long long int p = 1000000007) {
  long long int res = 1;
  while (second > 0) {
    if (second & 1) res = modpro(res, first, p);
    second = second >> 1;
    first = modpro(first, first, p);
  }
  return res;
}
inline long long int modInverse(long long int n, long long int p = 1000000007) {
  if (n == 1) return 1;
  return modpow(n, p - 2, p);
}
inline long long int moddiv(long long int n, long long int m,
                            long long int p = 1000000007) {
  return modpro(n, modInverse(m, p), p);
}
inline long long int modadd3(long long int first, long long int second,
                             long long int z, long long int p = 1000000007) {
  return modadd(modadd(first, second, p), z, p);
}
inline long long int modadd4(long long int first, long long int second,
                             long long int z, long long int w,
                             long long int p = 1000000007) {
  return modadd(modadd(first, second, p), modadd(z, w, p), p);
}
inline long long int modnCr(long long int fac[], int n, int r,
                            long long int p = 1000000007) {
  if (r == 0) return 1;
  return modpro(fac[n], modInverse(modpro(fac[r], fac[n - r], p), p), p);
}
template <typename T>
inline T max3(T first, T second, T z) {
  return max(max(first, second), z);
}
template <typename T>
inline T max4(T first, T second, T z, T w) {
  return max(max3(first, second, w), z);
}
template <typename T>
inline T min3(T first, T second, T z) {
  return min(min(first, second), z);
}
template <typename T>
inline T min4(T first, T second, T z, T w) {
  return min(min3(first, second, w), z);
}
template <typename T>
void printArr(T *arr, int s, int n) {
  for (int i = s; i <= n; i++) {
    cout << arr[i] << " ";
  }
  cout << endl;
}
int a[2005], b[2005];
vector<pair<int, char>> ans;
int c = 0;
void f(int l, int r) {
  if (l >= r) return;
  int big = -1;
  int mi = -1;
  for (int i = (l); i < (r + 1); i++) {
    if (a[i] > big) {
      big = a[i];
      mi = i;
    }
  }
  if (mi == l) {
    for (int i = (l + 1); i < (r + 1); i++)
      if (a[i] != a[l]) {
        mi = i - 1;
        break;
      }
  }
  int inl = l;
  int f = 1;
  for (int i = (l); i < (r + 1); i++)
    if (a[i] != big) f = 0;
  if (f) {
    cout << "NO";
    exit(0);
  }
  if (mi + 1 <= r && a[mi + 1] != a[mi]) {
    for (int i = (mi + 1); i < (r + 1); i++) {
      ans.push_back({c + mi - l, 'R'});
    }
    for (int i = (mi)-1; i >= (l); i--) {
      ans.push_back({c + i - l + 1, 'L'});
    }
  } else {
    for (int i = (mi)-1; i >= (l); i--) {
      ans.push_back({c + i - l + 1, 'L'});
    }
    for (int i = (mi + 1); i < (r + 1); i++) {
      ans.push_back({c, 'R'});
    }
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  int erer = 1;
  for (int erer2 = (1); erer2 < (erer + 1); erer2++) {
    int n;
    cin >> n;
    for (int i = (0); i < (n); i++) cin >> a[i];
    int k;
    cin >> k;
    for (int i = (0); i < (k); i++) cin >> b[i];
    int cur = 0;
    for (int i = (0); i < (n); i++) {
      int j = i;
      long long int sum = a[i];
      while (sum < b[cur] && j < n) {
        sum += a[++j];
      }
      if (sum != b[cur]) {
        cout << "NO" << endl;
        return 0;
      }
      f(i, j);
      cur++;
      c++;
      i = j;
    }
    if (cur < k) {
      cout << "NO" << endl;
      return 0;
    }
    cout << "YES" << endl;
    for (auto u : ans) cout << (u.first + 1) << " " << (u.second) << endl;
  }
  return 0;
}
