#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  int n, m, k;
  cin >> n >> m >> k;
  if (k > 4 * n * m - 2 * n - 2 * m) return cout << "NO\n", 0;
  cout << "YES\n";
  int cnt = 0;
  vector<pair<int, char> > ans;
  m--, n--;
  for (int i = 0; i <= n; i++) {
    if (cnt + m <= k) {
      if (m != 0) {
        cnt += m;
        ans.push_back({m, 'R'});
        if (cnt == k) break;
      }
    } else {
      ans.push_back({k - cnt, 'R'});
      cnt = k;
      break;
    }
    if (i == n) break;
    if (cnt + m <= k) {
      if (m != 0) {
        cnt += m;
        ans.push_back({m, 'L'});
        if (cnt == k) break;
      }
    } else {
      ans.push_back({k - cnt, 'L'});
      cnt = k;
      break;
    }
    cnt += 1;
    ans.push_back({1, 'D'});
    if (cnt == k) break;
  }
  if (cnt != k) {
    for (int i = 0; i <= m; i++) {
      if (cnt + n <= k) {
        if (n != 0) {
          cnt += n;
          ans.push_back({n, 'U'});
          if (cnt == k) break;
        }
      } else {
        ans.push_back({k - cnt, 'U'});
        cnt = k;
        break;
      }
      if (i == m) break;
      if (cnt + n <= k) {
        if (n != 0) {
          cnt += n;
          ans.push_back({n, 'D'});
          if (cnt == k) break;
        }
      } else {
        ans.push_back({k - cnt, 'D'});
        cnt = k;
        break;
      }
      cnt += 1;
      ans.push_back({1, 'L'});
      if (cnt == k) break;
    }
  }
  cout << ans.size() << endl;
  for (int i = 0; i < (int)ans.size(); i++)
    cout << ans[i].first << ' ' << ans[i].second << endl;
  return 0;
}
