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;
const int MAXN = 5005;
int N, M;
string grid[MAXN];
struct udlr {
  int u = -1, d = -1, l = -1, r = -1;
};
udlr orig[MAXN];
udlr adj[MAXN];
int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  cin >> N >> M;
  for (int a = 0; a < N; a++) {
    cin >> grid[a];
  }
  for (int a = 0; a < N; a++) {
    for (int b = 0; b < M; b++) {
      if (grid[a][b] == '.') {
        continue;
      }
      for (int c = a - 1; c >= 0; c--) {
        if (grid[c][b] != '.') {
          orig[a * M + b].u = c * M + b;
          break;
        }
      }
      for (int c = a + 1; c < N; c++) {
        if (grid[c][b] != '.') {
          orig[a * M + b].d = c * M + b;
          break;
        }
      }
      for (int c = b - 1; c >= 0; c--) {
        if (grid[a][c] != '.') {
          orig[a * M + b].l = a * M + c;
          break;
        }
      }
      for (int c = b + 1; c < M; c++) {
        if (grid[a][c] != '.') {
          orig[a * M + b].r = a * M + c;
          break;
        }
      }
    }
  }
  int best = 0, bestcnt = 0;
  for (int a = 0; a < N; a++) {
    for (int b = 0; b < M; b++) {
      if (grid[a][b] == '.') {
        continue;
      }
      copy(orig, orig + N * M, adj);
      int step = 0;
      int cur = a * M + b;
      while (cur != -1) {
        int nxt;
        char ch = grid[cur / M][cur % M];
        if (ch == 'U') {
          nxt = adj[cur].u;
        } else if (ch == 'D') {
          nxt = adj[cur].d;
        } else if (ch == 'L') {
          nxt = adj[cur].l;
        } else if (ch == 'R') {
          nxt = adj[cur].r;
        }
        if (adj[cur].u != -1) {
          adj[adj[cur].u].d = adj[cur].d;
        }
        if (adj[cur].d != -1) {
          adj[adj[cur].d].u = adj[cur].u;
        }
        if (adj[cur].l != -1) {
          adj[adj[cur].l].r = adj[cur].r;
        }
        if (adj[cur].r != -1) {
          adj[adj[cur].r].l = adj[cur].l;
        }
        step++;
        cur = nxt;
      }
      if (step > best) {
        best = step;
        bestcnt = 1;
      } else if (best == step) {
        bestcnt++;
      }
    }
  }
  cout << best << " " << bestcnt << "\n";
}
