10 10
.L.....R..
.........U
..D....D..
.R......L.
....L.....
.........D
......U...
D....R....
...U......
........L.
 5 5
DD..D
.....
LU...
U...U
.UL.U
 1 1
U
 5 5
UD..L
RRD..
..RDD
UUL..
DDLRR
 19 23
U..U..R........L...D...
.D.....UL.U.U........DR
..D.U..D....L......R...
D.......RL.L....D.....R
U..D.....U...U.L..D...U
...........L...........
U....U....D.U......LRR.
......RL...U...L.......
DLU..U......UU.U.U.D...
...........D....U......
U...DL......LL.....R...
...U..DD..........LD...
.R.........D.....UU...U
....D......R..........D
.L..........R.....L....
.R........L.LL....R....
..R...D........R....D..
.LR.R..LDU.DDRL......U.
...LL.....D.....DD.....
 11 29
URRUUDDLURLRDDLLRLDUDR.UDLLD.
LRRUDLUDLDULUDL.DURDRR.RRLLRR
D.DUDDURLRDDULDUDDUDDURRDLD.L
.RULURURRDLRRRLUUUU.RDLDLRRRL
.RLDDU.UUULUURURRLLUU.RLDRDUD
LRL.URRRDDURUURUDRRDLDDULRDRL
RLULDU.LRDUDRLDLRDDDDRUUDRDLL
DLUDURRDDUDLLDLLUURLDRUURRLUL
L.RRURRDDRRURRRDDUDRRDULR.LUR
LDLRULURRUULRDUUULLU.LLU.LLLL
DUURDULDDUDLRUUDRUULURLD.RL.U
 2 2
RD
UL
 1 10
LLLLLRRRRR
 3 3
...
...
..R
 17 13
...LD.UR.RUU.
LDLULDUDRRDRL
DD.RRLRUR.UD.
RU...D...LD..
.UR.R...URUUD
.RURD.RLR.D.R
.UUU.RU...UR.
UUUU.R.......
RL.LRU.UD.DUD
LD.DRURRLRDRL
.DR..UULUDDR.
LRLURRUUDDLUR
.LRDDLLR.L.DU
DRUDLLD.LRRU.
..DL.UDL.DUL.
U.DL..D..U.RD
RR.R...RL.L..

2 2
 4 1
 1 1
 8 3
 9 1
 94 1
 4 4
 5 2
 1 1
 24 2

#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<string> grid;
vector<vector<bool>> vis;
vector<vector<pair<int, int>>> nxtUP, nxtDown, nxtRight, nxtLeft;
const int N = 5005;
void init() {
  vis = vector<vector<bool>>(n + 5, vector<bool>(m + 5));
  nxtUP = vector<vector<pair<int, int>>>(n + 5, vector<pair<int, int>>(m + 5));
  nxtDown =
      vector<vector<pair<int, int>>>(n + 5, vector<pair<int, int>>(m + 5));
  nxtRight =
      vector<vector<pair<int, int>>>(n + 5, vector<pair<int, int>>(m + 5));
  nxtLeft =
      vector<vector<pair<int, int>>>(n + 5, vector<pair<int, int>>(m + 5));
}
void clear() {
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= m; j++) {
      vis[i][j] = false;
      nxtRight[i][j] = nxtLeft[i][j] = nxtUP[i][j] = nxtDown[i][j] = {i, j};
    }
  }
}
pair<int, int> get_nxt_up(int i, int j) {
  pair<int, int> nxt = nxtUP[i][j];
  nxt.first--;
  if (nxt.first <= -1 || nxt.second <= -1) return {-1, -1};
  if (nxt.first >= n || nxt.second >= m) return {n, m};
  if (!vis[nxt.first][nxt.second] && grid[nxt.first][nxt.second] != '.')
    return nxtUP[i][j] = nxt;
  return nxtUP[i][j] = get_nxt_up(nxt.first, nxt.second);
}
pair<int, int> get_nxt_down(int i, int j) {
  pair<int, int> nxt = nxtDown[i][j];
  nxt.first++;
  if (nxt.first <= -1 || nxt.second <= -1) return {-1, -1};
  if (nxt.first >= n || nxt.second >= m) return {n, m};
  if (!vis[nxt.first][nxt.second] && grid[nxt.first][nxt.second] != '.')
    return nxtDown[i][j] = nxt;
  return nxtDown[i][j] = get_nxt_down(nxt.first, nxt.second);
}
pair<int, int> get_nxt_right(int i, int j) {
  pair<int, int> nxt = nxtRight[i][j];
  nxt.second++;
  if (nxt.first <= -1 || nxt.second <= -1) return {-1, -1};
  if (nxt.first >= n || nxt.second >= m) return {n, m};
  if (!vis[nxt.first][nxt.second] && grid[nxt.first][nxt.second] != '.')
    return nxtRight[i][j] = nxt;
  return nxtRight[i][j] = get_nxt_right(nxt.first, nxt.second);
}
pair<int, int> get_nxt_left(int i, int j) {
  pair<int, int> nxt = nxtLeft[i][j];
  nxt.second--;
  if (nxt.first <= -1 || nxt.second <= -1) return {-1, -1};
  if (nxt.first >= n || nxt.second >= m) return {n, m};
  if (!vis[nxt.first][nxt.second] && grid[nxt.first][nxt.second] != '.')
    return nxtLeft[i][j] = nxt;
  return nxtLeft[i][j] = get_nxt_left(nxt.first, nxt.second);
}
int solve(int i, int j) {
  int ret = 0;
  while (true) {
    if (i == n || j == m || i == -1 || j == -1) break;
    ret++;
    vis[i][j] = true;
    pair<int, int> nxt;
    if (grid[i][j] == 'U') nxt = get_nxt_up(i, j);
    if (grid[i][j] == 'D') nxt = get_nxt_down(i, j);
    if (grid[i][j] == 'R') nxt = get_nxt_right(i, j);
    if (grid[i][j] == 'L') nxt = get_nxt_left(i, j);
    i = nxt.first;
    j = nxt.second;
  }
  return ret;
}
int freq[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  init();
  for (int i = 0; i < n; i++) {
    string x;
    cin >> x;
    grid.push_back(x);
  }
  int mx = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (grid[i][j] == '.') continue;
      clear();
      int curr = solve(i, j);
      freq[curr]++;
      mx = max(mx, curr);
    }
  }
  cout << mx << ' ' << freq[mx];
  return 0;
}
