#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define lint long long
#define pii pair<int, int>
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define SZ(v) ((int)v.size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MINF(a) memset(a, 0x3f, sizeof(a))
#define POW(n) (1LL << (n))
#define POPCNT(n) (__builtin_popcount(n))
#define IN(i,a,b) (a <= i && i <= b)
using namespace std;
template <typename T> inline bool CHMIN(T& a,T b) { if(a>b) { a=b; return 1; } return 0; }
template <typename T> inline bool CHMAX(T& a,T b) { if(a<b) { a=b; return 1; } return 0; }
template <typename T> inline void SORT(T& a) { sort(ALL(a)); }
template <typename T> inline void REV(T& a) { reverse(ALL(a)); }
template <typename T> inline void UNI(T& a) { sort(ALL(a)); a.erase(unique(ALL(a)),a.end()); }
template <typename T> inline T LB(vector<T>& v, T a) { return *lower_bound(ALL(v),a); }
template <typename T> inline int LBP(vector<T>& v, T a) { return lower_bound(ALL(v),a) - v.begin(); }
template <typename T> inline T UB(vector<T>& v, T a) { return *upper_bound(ALL(v),a); }
template <typename T> inline int UBP(vector<T>& v, T a) { return upper_bound(ALL(v),a) - v.begin(); }
template <typename T1, typename T2> ostream& operator<< (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os; }
template <typename T1, typename T2> istream& operator>> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; }
template <typename T> ostream& operator<< (ostream& os, const vector<T>& v) { REP(i,v.size()) { if (i) os << " "; os << v[i]; } return os; }
template <typename T> istream& operator>> (istream& is, vector<T>& v) { for(T& in : v) is >> in; return is; }
template <typename T = int> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...)); }
template <typename T, typename V> typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) { t = v; }
template <typename T, typename V> typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e, v); }
const lint MOD = 1000000007;
const lint INF = 0x3f3f3f3f3f3f3f3f;
const double PI = 3.14159265358979323846;
const double EPS = 1e-10;

int H, W;
string s[11];
// U = 0, D = 1, L = 2, R = 3
vector<vector<int>> dy = {{0, -1, 0}, {0, 1, 0}, {-1, 0, 1}, {-1, 0, 1}};
vector<vector<int>> dx = {{-1, 0, 1}, {-1, 0, 1}, {0, -1, 0}, {0, 1, 0}};
vector<vector<int>> ndir = {{2, 0, 3}, {2, 1, 3}, {0, 2, 1}, {0, 3, 1}};
const string ord = "UDLR";
bool used[11][11];
int cnt = 0;

void dfs(int y, int x, int dir, string& t) {
    if (SZ(t) == cnt) {
        cout << t << endl;
        exit(0);
    }
    REP(i, 3) {
        int ny = y, nx = x;
        while (IN(ny, 0, H - 1) && IN(nx, 0, W - 1) && (s[ny][nx] != 'o' || (s[ny][nx] == 'o' && used[ny][nx]))) ny += dy[dir][i], nx += dx[dir][i];
        if (!IN(ny, 0, H - 1) || !IN(nx, 0, W - 1)) continue;
        used[ny][nx] = true;
        t.push_back(ord[ndir[dir][i]]);
        dfs(ny, nx, ndir[dir][i], t);
        t.pop_back();
        used[ny][nx] = false;
    }
}

void _main() {
    cin >> H >> W;
    int sy, sx, dir;
    REP(i, H) {
        cin >> s[i];
        REP(j, W) {
            if (s[i][j] == 'o') ++cnt;
            if (s[i][j] != '.' && s[i][j] != 'o') {
                sy = i;
                sx = j;
                dir = ord.find(s[i][j]);
                s[i][j] = 'o';
                used[i][j] = true;
            }
        }
    }
    string t;
    dfs(sy, sx, dir, t);
}

signed main(signed argc, char **argv) {
    if (argc > 1) {
        if (strchr(argv[1], 'i')) freopen("input.txt", "r", stdin);
        if (strchr(argv[1], 'o')) freopen("output.txt", "w", stdout);
    }
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);
    _main();
    return 0;
}


Measured memory_bytes: 3228