#include <bits/stdc++.h>
using namespace std;
template <class C>
void min_self(C &a, C b) {
  a = min(a, b);
}
template <class C>
void max_self(C &a, C b) {
  a = max(a, b);
}
const long long MOD = 1000000007;
long long mod(long long n, long long m = MOD) {
  n %= m, n += m, n %= m;
  return n;
}
const int MAXN = 1e5 + 5;
const int LOGN = 21;
const long long INF = 1e14;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, m, k;
  cin >> n >> m >> k;
  if (k > 4 * m * n - 2 * m - 2 * n) {
    cout << "NO\n";
    return 0;
  }
  int row = 1, go = 0;
  vector<pair<int, string>> ans;
  while (k > 0) {
    if (row == 1) {
      go = min(k, m - 1);
      if (go != 0) ans.push_back({go, "R"});
      k -= go;
      if (k == 0) break;
      go = min(k, m - 1);
      if (go != 0) ans.push_back({go, "L"});
      k -= go;
      if (k == 0) break;
      ans.push_back({1, "D"});
      k--;
      row++;
    } else if (row < n) {
      go = min(k / 3, m - 1);
      if (go != 0) ans.push_back({go, "RUD"});
      k -= 3 * go;
      if (go != m - 1) {
        if (k == 0)
          break;
        else if (k == 1) {
          ans.push_back({1, "R"});
          k--;
          break;
        } else {
          ans.push_back({1, "RU"});
          k -= 2;
          break;
        }
      } else {
        go = min(k, m - 1);
        if (go != 0) ans.push_back({go, "L"});
        k -= go;
        if (k == 0) break;
      }
      ans.push_back({1, "D"});
      k--;
      row++;
    } else {
      go = min(k / 3, m - 1);
      if (go != 0) ans.push_back({go, "RUD"});
      k -= 3 * go;
      if (go != m - 1) {
        if (k == 0)
          break;
        else if (k == 1) {
          ans.push_back({1, "R"});
          k--;
          break;
        } else {
          ans.push_back({1, "RU"});
          k -= 2;
          break;
        }
      } else {
        go = min(k, m - 1);
        if (go != 0) ans.push_back({go, "L"});
        k -= go;
        if (k == 0) break;
      }
      go = min(k, n - 1);
      if (go != 0) ans.push_back({go, "U"});
      k -= go;
      if (k == 0)
        break;
      else {
        cout << "NO\n";
        return 0;
      }
    }
  }
  cout << "YES\n";
  cout << ans.size(), cout << "\n";
  for (auto x : ans) {
    cout << x.first << " " << x.second, cout << "\n";
  }
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
