#include <bits/stdc++.h>
using namespace std;
const int maxn = 100 + 7;
char a[maxn][maxn];
int n, m;
char srow[2] = {'L', 'R'};
char scol[2] = {'U', 'D'};
int px, py;
int aimx, aimy;
bool found;
void gao(char x) {
  if (found) return;
  cout << x << "\n";
  fflush(stdout);
  cin >> px >> py;
  px--;
  py--;
  if (px == aimx && py == aimy) found = true;
}
void checkrc() {
  bool chr = false, chc = false;
  gao(srow[0]);
  if (px == 0 && py == 1) gao(srow[1]), swap(srow[0], srow[1]);
  gao(scol[0]);
  if (px == 1 && py == 0) swap(scol[0], scol[1]);
}
bool checkrow() {
  if (m < 2 || a[0][1] == '*') return false;
  for (int j = 1; j < m; j++) {
    if (a[0][j] == '*') return false;
    if (a[1][j] != '*') {
      gao(srow[0]);
      if (py == 1)
        swap(srow[0], srow[1]);
      else
        gao(srow[1]);
      while (py < j) gao(srow[1]);
      gao(scol[0]);
      if (px == 1) swap(scol[0], scol[1]);
      return true;
    }
  }
  return false;
}
bool checkcol() {
  if (n < 2 || a[1][0] == '*') return false;
  for (int i = 1; i < n; i++) {
    if (a[i][0] == '*') return false;
    if (a[i][1] != '*') {
      gao(scol[0]);
      if (px == 1)
        swap(scol[0], scol[1]);
      else
        gao(scol[1]);
      while (px < i) gao(scol[1]);
      gao(srow[0]);
      if (py == 1) swap(srow[0], srow[1]);
      return true;
    }
  }
  return false;
}
void check() {
  if (n >= 2 && m >= 2 && a[0][1] != '*' && a[1][0] != '*')
    checkrc();
  else {
    if (!checkrow() && !checkcol()) {
      if (m >= 2 && a[0][1] != '*') {
        gao(srow[0]);
        if (py == 1) swap(srow[0], srow[1]);
      }
      if (n >= 2 && a[1][0] != '*') {
        gao(scol[0]);
        if (px == 1) swap(scol[0], scol[1]);
      }
    }
  }
}
int dis[maxn][maxn], vis[maxn][maxn];
pair<int, int> pre[maxn][maxn], path[maxn * maxn];
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, 1, -1};
void dfs() {
  memset(dis, 63, sizeof(dis));
  memset(vis, 0, sizeof(vis));
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) pre[i][j] = pair<int, int>(-1, -1);
  dis[px][py] = 0;
  vis[px][py] = 1;
  queue<pair<int, int> > que;
  que.push(pair<int, int>(px, py));
  while (!que.empty()) {
    pair<int, int> cur = que.front();
    que.pop();
    vis[cur.first][cur.second] = 0;
    for (int i = 0; i < 4; i++) {
      int nx = cur.first + dx[i], ny = cur.second + dy[i];
      if (nx < 0 || ny < 0 || nx >= n || ny >= m || a[nx][ny] == '*') continue;
      if (dis[cur.first][cur.second] + 1 < dis[nx][ny]) {
        dis[nx][ny] = dis[cur.first][cur.second] + 1;
        pre[nx][ny] = pair<int, int>(cur.first, cur.second);
        if (!vis[nx][ny]) {
          que.push(pair<int, int>(nx, ny));
          vis[nx][ny] = 1;
        }
      }
    }
  }
  int prex = pre[aimx][aimy].first, prey = pre[aimx][aimy].second;
  int cnt = 0;
  path[cnt++] = pair<int, int>(aimx, aimy);
  while (prex != -1 && prey != -1) {
    path[cnt++] = pair<int, int>(prex, prey);
    int tx = prex, ty = prey;
    prex = pre[tx][ty].first;
    prey = pre[tx][ty].second;
  }
  reverse(path, path + cnt);
  for (int i = 1; i < cnt; i++) {
    if (path[i].first == path[i - 1].first) {
      bool bo = path[i].second > path[i - 1].second;
      gao(srow[bo]);
    } else {
      bool bo = path[i].first > path[i - 1].first;
      gao(scol[bo]);
    }
  }
}
int main() {
  cin >> n >> m;
  px = py = 0;
  found = false;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      if (a[i][j] == 'F') aimx = i, aimy = j;
  if (n == 1 && m == 1) return 0;
  check();
  dfs();
  return 0;
}
