#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int main() {
  scanf("%d%d%d", &n, &m, &k);
  int sum = 4 * n * m - 2 * n - 2 * m;
  if (k > sum) {
    printf("NO\n");
  } else {
    printf("YES\n");
    int line = (m - 1) + 3 * (m - 1) + 1;
    int c = k / line;
    int d = k % line;
    int back_r = 0, back_udr = 0, back_d = 0;
    int last = 0;
    int cnt = 0;
    if (m - 1 == 0) {
      int u = 0, d = 0;
      if (k >= n - 1) {
        k -= (n - 1);
        u = n - 1;
      } else {
        u = k;
        k = 0;
      }
      d = k;
      int cnt = 0;
      if (u) {
        cnt++;
      }
      if (d) {
        cnt++;
      }
      printf("%d\n", cnt);
      if (d) {
        printf("%d D\n", d);
      }
      if (u) {
        printf("%d U\n", u);
      }
      return 0;
    }
    if (n - 1 == 0) {
      int l = 0, r = 0;
      if (k >= m - 1) {
        k -= (m - 1);
        l = m - 1;
      } else {
        l = k;
        k = 0;
      }
      r = k;
      int cnt = 0;
      if (l) {
        cnt++;
      }
      if (r) {
        cnt++;
      }
      printf("%d\n", cnt);
      if (l) {
        printf("%d R\n", l);
      }
      if (r) {
        printf("%d L\n", r);
      }
      return 0;
    }
    if (c != n - 1) {
      int f = 0;
      if (d >= m - 1) {
        d -= (m - 1);
        back_r = m - 1;
      } else {
        back_r = d;
        d = 0;
      }
      if (d >= (m - 1) * 3) {
        d -= (m - 1) * 3;
        back_udr = m - 1;
      } else {
        int cn = d / 3;
        back_udr = cn;
        last = d % 3;
      }
      if (back_r) {
        cnt++;
      }
      if (back_udr) {
        cnt++;
      }
      if (last) {
        cnt++;
      }
      printf("%d\n", c * 3 + cnt);
      for (int i = 1; i <= c; i++) {
        printf("%d R\n%d DUL\n1 D\n", m - 1, m - 1);
      }
      if (back_r) {
        printf("%d R\n", back_r);
      }
      if (back_udr) {
        printf("%d DUL\n", back_udr);
      }
      if (last) {
        if (last == 1) {
          printf("1 D\n");
        } else {
          printf("1 DU\n");
        }
      }
    } else if (c == n - 1) {
      int back_d = 0, back_u = 0;
      if (d >= m - 1) {
        back_r = m - 1;
        d -= (m - 1);
      } else {
        back_r = d;
        d = 0;
      }
      if (d >= m - 1) {
        back_d = m - 1;
        d -= (m - 1);
      } else {
        back_d = d;
        d = 0;
      }
      back_u = d;
      int cnt = 0;
      if (back_r) {
        cnt++;
      }
      if (back_d) {
        cnt++;
      }
      if (back_u) {
        cnt++;
      }
      printf("%d\n", c * 3 + cnt);
      for (int i = 1; i <= c; i++) {
        printf("%d R\n%d DUL\n1 D\n", m - 1, m - 1);
      }
      if (back_r) {
        printf("%d R\n", back_r);
      }
      if (back_d) {
        printf("%d L\n", back_d);
      }
      if (back_u) {
        printf("%d U\n", back_u);
      }
    }
  }
}
