#include <bits/stdc++.h>
using namespace std;
const int N = 501;
int n, m, k, S[3001], top = 0;
string c[3001];
int main() {
  scanf("%d%d%d", &n, &m, &k);
  int can = n * (m - 1) + m * (n - 1);
  can *= 2;
  if (can < k) {
    printf("NO\n");
    return 0;
  }
  printf("YES\n");
  if (k >= (m - 1)) {
    S[++top] = (m - 1);
    c[top] = "R";
    k -= (m - 1);
  } else {
    S[++top] = k;
    c[top] = "R";
    k = 0;
  }
  if (k >= (m - 1)) {
    S[++top] = (m - 1);
    c[top] = "L";
    k -= (m - 1);
  } else {
    S[++top] = k;
    c[top] = "L";
    k = 0;
  }
  for (int i = 1; i <= n - 1 && k > 0; i++) {
    k--;
    S[++top] = 1;
    c[top] = "D";
    int ovo = k / 3;
    if (ovo >= (m - 1)) {
      S[++top] = (m - 1);
      c[top] = "RUD";
      k -= (m - 1) * 3;
    } else {
      S[++top] = ovo;
      c[top] = "RUD";
      k -= ovo * 3;
      if (k > 0) {
        S[++top] = 1;
        if (k == 1) {
          c[top] = "R";
        }
        if (k == 2) {
          c[top] = "RU";
        }
        k = 0;
      }
    }
    if (k >= (m - 1)) {
      S[++top] = (m - 1);
      c[top] = "L";
      k -= (m - 1);
    } else {
      S[++top] = k;
      c[top] = "L";
      k = 0;
    }
  }
  if (k > 0) {
    S[++top] = k;
    c[top] = "U";
    k = 0;
  }
  int ooo = 0;
  for (int i = 1; i <= top; i++) {
    if (S[i] == 0) {
      ooo++;
    }
  }
  printf("%d\n", top - ooo);
  for (int i = 1; i <= top; i++) {
    if (S[i] != 0) {
      printf("%d ", S[i]);
      cout << c[i];
      printf("\n");
    }
  }
  return 0;
}
