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>
struct node {
  int dir;
  int nxt[4];
  int tmp[4];
} nn[6000];
char map[5010][5010];
int cnt, conv[5010][5010], N, M;
int cv[300];
int main() {
  cv['U'] = 0;
  cv['L'] = 1;
  cv['R'] = 2;
  cv['D'] = 3;
  scanf("%d%d", &N, &M);
  for (int i = 0; i < N; i++) {
    scanf("%s", map[i]);
    for (int j = 0; j < M; j++) {
      if (map[i][j] != '.') {
        ++cnt;
        nn[cnt].dir = cv[map[i][j]];
        conv[i][j] = cnt;
      }
    }
  }
  for (int i = 0; i < N; i++) {
    int pre = 0;
    for (int j = 0; j < M; j++) {
      if (conv[i][j] != 0) {
        int now = conv[i][j];
        nn[now].nxt[cv['L']] = pre;
        nn[pre].nxt[cv['R']] = now;
        pre = now;
      }
    }
  }
  for (int j = 0; j < M; j++) {
    int pre = 0;
    for (int i = 0; i < N; i++) {
      if (conv[i][j] != 0) {
        int now = conv[i][j];
        nn[now].nxt[cv['U']] = pre;
        nn[pre].nxt[cv['D']] = now;
        pre = now;
      }
    }
  }
  int maxcnt = 0, max = -1;
  for (int i = 1; i <= cnt; i++) {
    for (int j = 1; j <= cnt; j++) {
      for (int d = 0; d < 4; d++) nn[j].tmp[d] = nn[j].nxt[d];
    }
    int np = i, now = 0;
    while (np) {
      now++;
      int nd = nn[np].dir, nxt, pre;
      nxt = nn[np].tmp[0];
      pre = nn[np].tmp[3];
      nn[nxt].tmp[3] = pre;
      nn[pre].tmp[0] = nxt;
      nxt = nn[np].tmp[1];
      pre = nn[np].tmp[2];
      nn[nxt].tmp[2] = pre;
      nn[pre].tmp[1] = nxt;
      np = nn[np].tmp[nd];
    }
    if (now > max) {
      max = now;
      maxcnt = 0;
    }
    if (now == max) {
      maxcnt++;
    }
  }
  printf("%d %d\n", max, maxcnt);
}
