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>
const int d[4][2] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
const int maxn = 50005;
int f[maxn][4], N, M, T, ans = 0, tot;
char st[maxn], maq[maxn];
inline int h(int xx, int yy) { return (xx - 1) * N + yy; }
inline void make_link(int xx, int yy) {
  int u = h(xx, yy);
  for (int k = 0; k < 4; ++k) f[u][k] = h(xx + d[k][0], yy + d[k][1]);
}
inline int getfather(int u, int dire) {
  if (f[u][dire] == u) return u;
  f[u][dire] = getfather(f[u][dire], dire);
  return f[u][dire];
}
int main() {
  scanf("%d%d", &M, &N);
  M += 2;
  N += 2;
  T = M * N;
  for (int i = 2; i < M; ++i) {
    scanf("%s", st + 2);
    for (int j = 2; j < N; ++j) maq[h(i, j)] = st[j];
  }
  for (int i = 2; i < M; ++i)
    for (int j = 2; j < N; ++j) {
      if (maq[h(i, j)] == '.') continue;
      for (int u = 1; u <= T; ++u)
        for (int k = 0; k < 4; ++k) f[u][k] = u;
      int x = i, y = j, cnt = 0, dire = 0;
      for (;;) {
        int u = h(x, y);
        if (x < 2 || x > M - 1) break;
        if (y < 2 || y > N - 1) break;
        if (maq[u] == '.') {
          make_link(x, y);
          x += d[dire][0];
          y += d[dire][1];
          continue;
        }
        ++cnt;
        make_link(x, y);
        if (maq[u] == 'U')
          dire = 0;
        else if (maq[u] == 'R')
          dire = 1;
        else if (maq[u] == 'D')
          dire = 2;
        else if (maq[u] == 'L')
          dire = 3;
        int z = getfather(h(x, y), dire);
        x = (z - 1) / N + 1;
        y = (z - 1) % N + 1;
      }
      if (cnt > ans)
        ans = cnt, tot = 1;
      else if (cnt == ans)
        ++tot;
    }
  printf("%d %d\n", ans, tot);
  return 0;
}
