#include <bits/stdc++.h>
using namespace std;
long long int mod = 1000000007;
void __print(long long int x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename Th, typename V>
void __print(const pair<Th, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename Th>
void __print(const Th &x) {
  long long int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename Th, typename... V>
void _print(Th t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
void binary_rock() {
  long long int n, m, k;
  cin >> n >> m >> k;
  long long int i, j, l;
  long long int max = 4 * n * m - n - n - m - m;
  if (k > max) {
    cout << "NO" << endl;
    return;
  }
  cout << "YES" << endl;
  if (n == 1) {
    if (k <= m - 1) {
      cout << "1" << endl;
      cout << k << " R" << endl;
    } else {
      cout << "2" << endl;
      cout << m - 1 << " R" << endl;
      cout << k - m + 1 << " L" << endl;
    }
    return;
  }
  if (m == 1) {
    if (k <= n - 1) {
      cout << "1" << endl;
      cout << k << " D" << endl;
    } else {
      cout << "2" << endl;
      cout << n - 1 << " D" << endl;
      cout << k - n + 1 << " U" << endl;
    }
    return;
  }
  vector<pair<long long int, char>> pri;
  long long int count = 0;
  long long int times = 0;
  for (times = 0; times < n - 1; times++) {
    if (m - 1 < k) {
      pri.push_back({m - 1, 'R'});
      k -= (m - 1);
    } else {
      pri.push_back({k, 'R'});
      k -= k;
      break;
    }
    if (m - 1 < k) {
      pri.push_back({m - 1, 'L'});
      k -= (m - 1);
    } else {
      pri.push_back({k, 'L'});
      k -= k;
      break;
    }
    if (1 < k) {
      pri.push_back({1, 'D'});
      k -= 1;
    } else {
      pri.push_back({k, 'D'});
      k -= k;
      break;
    }
  }
  if (k == 0) {
    cout << pri.size() << endl;
    for (auto it : pri) {
      cout << it.first << " " << it.second << endl;
    }
    return;
  }
  for (times = 0; times < m - 1; times++) {
    if (1 < k) {
      pri.push_back({1, 'R'});
      k -= 1;
    } else {
      pri.push_back({k, 'R'});
      k -= k;
      break;
    }
    if (n - 1 < k) {
      pri.push_back({n - 1, 'U'});
      k -= (n - 1);
    } else {
      pri.push_back({k, 'U'});
      k -= k;
      break;
    }
    if (n - 1 < k) {
      pri.push_back({n - 1, 'D'});
      k -= (n - 1);
    } else {
      pri.push_back({k, 'D'});
      k -= k;
      break;
    }
  }
  if (k == 0) {
    cout << pri.size() << endl;
    for (auto it : pri) {
      cout << it.first << " " << it.second << endl;
    }
    return;
  }
  if (m - 1 < k) {
    pri.push_back({m - 1, 'L'});
    k -= (m - 1);
  } else {
    pri.push_back({k, 'L'});
    k -= k;
    if (k == 0) {
      cout << pri.size() << endl;
      for (auto it : pri) {
        cout << it.first << " " << it.second << endl;
      }
      return;
    }
  }
  pri.push_back({k, 'U'});
  cout << pri.size() << endl;
  for (auto it : pri) {
    cout << it.first << " " << it.second << endl;
  }
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  clock_t t1 = clock();
  long long int t = 1;
  while (t--) {
    binary_rock();
  }
  clock_t t2 = clock();
  return 0;
}
