#include <bits/stdc++.h>
using namespace std;
vector<pair<int, char> > ans, tot;
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 1; i < n; i++) {
    if (m != 1) {
      ans.push_back(make_pair(m - 1, 'R'));
      ans.push_back(make_pair(m - 1, 'L'));
      ans.push_back(make_pair(1, 'D'));
    }
  }
  if (m != 1)
    ans.push_back(make_pair(m - 1, 'R'));
  else if (m == 1)
    ans.push_back(make_pair(n - 1, 'D'));
  for (int i = 1; i < m; i++) {
    if (n != 1) {
      ans.push_back(make_pair(n - 1, 'U'));
      ans.push_back(make_pair(n - 1, 'D'));
      ans.push_back(make_pair(1, 'L'));
    }
  }
  if (n != 1)
    ans.push_back(make_pair(n - 1, 'U'));
  else if (n == 1)
    ans.push_back(make_pair(m - 1, 'L'));
  int flag = 1;
  for (int i = 0; i < ans.size(); i++) {
    int w = ans[i].first;
    k -= w;
    tot.push_back(ans[i]);
    if (k <= 0) break;
  }
  if (k > 0)
    puts("NO");
  else {
    puts("YES");
    int sz = tot.size();
    cout << sz << '\n';
    for (int i = 0; i < sz - 1; i++)
      printf("%d %c\n", tot[i].first, tot[i].second);
    printf("%d %c\n", tot[sz - 1].first + k, tot[sz - 1].second);
  }
  return 0;
}
