#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  if (k > (4 * n * m - (2 * n + 2 * m))) {
    cout << "NO" << endl;
    exit(0);
  } else if (m == 1) {
    if (k > n - 1) {
      cout << "YES\n2" << endl;
      cout << n - 1 << " D" << endl;
      cout << k - (n - 1) << " U" << endl;
    } else {
      cout << "1\n" << k << " D" << endl;
    }
    exit(0);
  } else if (n == 1) {
    if (k > m - 1) {
      cout << "YES\n2" << endl;
      cout << m - 1 << " R" << endl;
      cout << k - (m - 1) << " L" << endl;
    } else {
      cout << "YES\n1\n" << k << " R" << endl;
    }
    exit(0);
  }
  int ans = 0;
  int a[4] = {0};
  int last = -1;
  int temp = k;
  if (temp > (n - 1) * (2 * (m - 1) + 1)) {
    ans = ans + 3 * (n - 1);
    a[0] = n - 1;
    temp = temp - (n - 1) * (2 * (m - 1) + 1);
    if (temp > (m - 1) * (2 * (n - 1) + 1)) {
      ans = ans + 3 * (m - 1);
      a[1] = m - 1;
      temp = temp - (m - 1) * (2 * (n - 1) + 1);
      if (temp > m - 1) {
        ans += 1;
        a[2] = 1;
        temp = temp - (m - 1);
        if (temp > n - 1) {
          cout << "NO" << endl;
          exit(0);
        } else if (temp != 0) {
          a[3] = 1;
          last = 3;
          ans += 1;
        }
      } else if (temp != 0) {
        ans += 1;
        a[2] = 1;
        last = 2;
      }
    } else if (temp != 0) {
      a[1] = temp / (2 * (n - 1) + 1);
      ans = ans + 3 * (temp / (2 * (n - 1) + 1));
      if (temp % (2 * (n - 1) + 1) != 0) {
        last = 1;
        temp = temp % (2 * (n - 1) + 1);
        if (temp > 1) {
          ans++;
          temp--;
          if (temp > n - 1) {
            ans++;
            temp -= n - 1;
            if (temp != 0) {
              ans += 1;
            }
          } else {
            ans++;
          }
        } else {
          ans++;
        }
      }
    }
  } else if (temp != 0) {
    ans = ans + 3 * (temp / (2 * (m - 1) + 1));
    a[0] = temp / (2 * (m - 1) + 1);
    if (temp % (2 * (m - 1) + 1) != 0) {
      last = 0;
      temp = temp % (2 * (m - 1) + 1);
      if (temp > m - 1) {
        ans++;
        temp = temp - (m - 1);
        if (temp > m - 1) {
          ans += 2;
        } else if (temp != 0) {
          ans++;
        }
      } else {
        ans++;
      }
    }
  }
  cout << "YES\n" << ans << endl;
  if (a[0] != 0 || last == 0) {
    k -= (a[0] * (2 * (m - 1) + 1));
    while (a[0] != 0) {
      cout << m - 1 << " R" << endl;
      cout << m - 1 << " L" << endl;
      cout << 1 << " D" << endl;
      a[0]--;
    }
    if (last == 0) {
      cout << min(m - 1, k) << " R" << endl;
      k -= min(m - 1, k);
      if (k != 0) cout << min(m - 1, k) << " L" << endl;
      k -= min(m - 1, k);
      if (k != 0) cout << 1 << " D" << endl;
    }
  }
  if (a[1] != 0 || last == 1) {
    k -= (a[1] * (2 * (n - 1) + 1));
    while (a[1] != 0) {
      cout << 1 << " R" << endl;
      cout << n - 1 << " U" << endl;
      cout << n - 1 << " D" << endl;
      a[1]--;
    }
    if (last == 1) {
      cout << 1 << " R" << endl;
      k--;
      if (k != 0) cout << min(n - 1, k) << " U" << endl;
      k -= min(n - 1, k);
      if (k != 0) cout << min(n - 1, k) << " D" << endl;
    }
  }
  if (a[2] != 0 || last == 2) {
    cout << min(k, m - 1) << " L" << endl;
    k -= min(k, m - 1);
  }
  if (a[3] != 0) {
    cout << min(k, n - 1) << " U" << endl;
  }
}
