#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = acos(-1.0);
const double EPS = 1e-8;
const int MOD = 998244353;
template <typename T>
void cmin(T &x, T y) {
  if (y < x) x = y;
}
template <typename T>
void cmax(T &x, T y) {
  if (y > x) x = y;
}
long long qpow(long long x, long long n, long long mod = MOD) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % mod;
    x = x * x % mod;
    n >>= 1;
  }
  return res;
}
namespace Solver {
void InitOnce() {}
int n, m, k;
void Read() {
  int res = scanf("%d%d%d", &n, &m, &k);
  if (res == -1) exit(0);
}
vector<pair<int, string> > ans;
void goRight() {
  if (k == 0) return;
  int t = min(k, m - 1);
  if (t > 0) {
    ans.emplace_back(t, "R");
    k -= t;
  }
}
void goLeft() {
  if (k == 0) return;
  int t = min(k / 3, m - 1);
  if (t > 0) {
    ans.emplace_back(t, "DUL");
    k -= 3 * t;
  }
  if (t != m - 1) {
    assert(k < 3);
    if (k == 0) return;
    if (k == 1) {
      ans.emplace_back(1, "D");
      --k;
      return;
    }
    assert(k == 2);
    ans.emplace_back(1, "DU");
    --k;
    --k;
    return;
  }
}
void goDown() {
  if (k == 0) return;
  ans.emplace_back(1, "D");
  k -= 1;
}
void goLeft2() {
  if (k == 0) return;
  int t = min(k, m - 1);
  if (t > 0) {
    ans.emplace_back(t, "L");
    k -= t;
  }
}
void goUp() {
  if (k == 0) return;
  int t = min(k, n - 1);
  if (t > 0) {
    ans.emplace_back(t, "U");
    k -= t;
  }
}
void Solve() {
  if (k > (4 * n * m - 2 * n - 2 * m)) {
    puts("NO");
    return;
  }
  ans.clear();
  puts("YES");
  int curn = 1;
  while (k) {
    goRight();
    if (k == 0) break;
    if (curn == n) break;
    goLeft();
    if (k == 0) break;
    goDown();
    ++curn;
    if (k == 0) break;
  }
  while (k) {
    goLeft2();
    if (k == 0) break;
    goUp();
    if (k == 0) break;
    assert(k == 0);
  }
  assert(k == 0);
  printf("%u\n", ans.size());
  for (auto &i : ans) cout << i.first << " " << i.second << endl;
}
}  // namespace Solver
int main() {
  Solver::InitOnce();
  while (true) {
    Solver::Read();
    Solver::Solve();
  }
  return 0;
}
