#include <bits/stdc++.h>
using namespace std;
vector<string> moves;
void finish() {
  cout << moves.size() << "\n";
  for (auto u : moves) cout << u;
}
int main() {
  int n, m, k, counter, cn = 1;
  cin >> n >> m >> k;
  counter = k;
  if (k <= 4 * n * m - 2 * n - 2 * m)
    cout << "YES\n";
  else {
    cout << "NO\n";
    return 0;
  }
  if (n == 1) {
    for (int i = 0; i < m - 1; i++) {
      moves.push_back("1 R\n");
      counter--;
      if (counter == 0) {
        finish();
        return 0;
      }
    }
    for (int i = 0; i < m - 1; i++) {
      moves.push_back("1 L\n");
      counter--;
      if (counter == 0) {
        finish();
        return 0;
      }
    }
  } else if (m == 1) {
    for (int i = 0; i < n - 1; i++) {
      moves.push_back("1 D\n");
      counter--;
      if (counter == 0) {
        finish();
        return 0;
      }
    }
    for (int i = 0; i < n - 1; i++) {
      moves.push_back("1 U\n");
      counter--;
      if (counter == 0) {
        finish();
        return 0;
      }
    }
  }
  while (cn != n) {
    if (counter == 0) {
      finish();
      return 0;
    }
    moves.push_back(to_string(((m - 1 < counter) ? m - 1 : counter)) + " R\n");
    counter -= ((m - 1 < counter) ? m - 1 : counter);
    if (counter == 0) {
      finish();
      return 0;
    }
    if (3 * (m - 1) <= counter) {
      moves.push_back(to_string(m - 1) + " DUL\n");
      counter -= 3 * (m - 1);
      if (counter == 0) {
        finish();
        return 0;
      }
    } else {
      int cm = 1;
      while (cm != m) {
        moves.push_back("1 D\n");
        counter--;
        if (counter == 0) {
          finish();
          return 0;
        }
        moves.push_back("1 U\n");
        counter--;
        if (counter == 0) {
          finish();
          return 0;
        }
        moves.push_back("1 L\n");
        counter--;
        if (counter == 0) {
          finish();
          return 0;
        }
        cm++;
      }
    }
    moves.push_back("1 D\n");
    counter--;
    if (counter == 0) {
      finish();
      return 0;
    }
    cn++;
  }
  moves.push_back(to_string(((m - 1 < counter) ? m - 1 : counter)) + " R\n");
  counter -= ((m - 1 < counter) ? m - 1 : counter);
  if (counter == 0) {
    finish();
    return 0;
  }
  moves.push_back(to_string(((m - 1 < counter) ? m - 1 : counter)) + " L\n");
  counter -= ((m - 1 < counter) ? m - 1 : counter);
  if (counter == 0) {
    finish();
    return 0;
  }
  moves.push_back(to_string(((n - 1 < counter) ? n - 1 : counter)) + " U\n");
  counter -= ((n - 1 < counter) ? n - 1 : counter);
  if (counter == 0) {
    finish();
    return 0;
  }
}
