#include <bits/stdc++.h>   using namespace std;   int N, M, K;   vector<pair<int, char> > r, rr;   int main() {     scanf( %d %d %d , &N, &M, &K);     if (4 * N * M - 2 * N - 2 * M < K) return !printf( NO );     printf( YES n );     int c;     char d;     c = M - 1;     d =  R ;     r.push_back({min(c, K), d});     K -= c;     if (K <= 0) goto END;     for (int i = 0; i < M - 1; i++) {       c = N - 1;       d =  D ;       r.push_back({min(c, K), d});       K -= c;       if (K <= 0) goto END;       c = N - 1;       d =  U ;       r.push_back({min(c, K), d});       K -= c;       if (K <= 0) goto END;       c = 1;       d =  L ;       r.push_back({min(c, K), d});       K -= c;       if (K <= 0) goto END;     }     for (int i = 0; i < N - 1; i++) {       c = 1;       d =  D ;       r.push_back({min(c, K), d});       K -= c;       if (K <= 0) goto END;       c = M - 1;       d =  R ;       r.push_back({min(c, K), d});       K -= c;       if (K <= 0) goto END;       c = M - 1;       d =  L ;       r.push_back({min(c, K), d});       K -= c;       if (K <= 0) goto END;     }     c = N - 1;     d =  U ;     r.push_back({min(c, K), d});     K -= c;     if (K <= 0) goto END;   END:     for (int i = 0; i < r.size(); i++)       if (r[i].first > 0) rr.push_back(r[i]);     r = rr;     printf( %d n , r.size());     for (int i = 0; i < r.size(); i++) printf( %d %c n , r[i].first, r[i].second);     return 0;   }   