#include <bits/stdc++.h>
using namespace std;
const long long N = 200001;
const long long MOD = 1000000007;
const long long INF = LLONG_MAX;
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  int t = 1, cs = 0;
  while (t--) {
    int n, m, k, i, tmp;
    cin >> n >> m >> k;
    if (4 * n * m - 2 * n - 2 * m < k) return cout << "NO" << '\n', 0;
    vector<pair<int, string>> v;
    for (i = 1; i <= n && k; i++) {
      tmp = min(m - 1, k);
      if (tmp) {
        v.push_back(make_pair(tmp, "R"));
        k -= tmp;
      }
      if (i == 1) {
        tmp = min(m - 1, k);
        if (tmp) {
          v.push_back(make_pair(tmp, "L"));
          k -= tmp;
        }
      } else {
        tmp = min(3 * (m - 1), k);
        if (tmp) {
          if (tmp / 3) v.push_back(make_pair(tmp / 3, "UDL"));
          if (tmp % 3 == 1) v.push_back(make_pair(1, "U"));
          if (tmp % 3 == 2) v.push_back(make_pair(1, "UD"));
          k -= tmp;
        }
      }
      if (i == n) {
        tmp = min(n - 1, k);
        if (tmp) {
          v.push_back(make_pair(tmp, "U"));
          k -= tmp;
        }
      } else {
        if (k) {
          v.push_back(make_pair(1, "D"));
          k--;
        }
      }
    }
    cout << "YES" << '\n';
    cout << v.size() << '\n';
    for (auto it : v) cout << it.first << ' ' << it.second << '\n';
  }
}
