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;
struct NODE {
  char c;
  NODE *l, *r, *u, *d;
  NODE(char C) {
    c = C;
    u = d = l = r = (NODE *)0;
  }
};
int f(NODE *pos) {
  if (pos == NULL) return 0;
  int ans;
  NODE *l = pos->l, *r = pos->r, *u = pos->u, *d = pos->d;
  if (l) l->r = r;
  if (r) r->l = l;
  if (u) u->d = d;
  if (d) d->u = u;
  if (pos->c == 'U')
    ans = f(pos->u) + 1;
  else if (pos->c == 'D')
    ans = f(pos->d) + 1;
  else if (pos->c == 'L')
    ans = f(pos->l) + 1;
  else if (pos->c == 'R')
    ans = f(pos->r) + 1;
  if (l) l->r = pos;
  if (r) r->l = pos;
  if (u) u->d = pos;
  if (d) d->u = pos;
  return ans;
}
int main() {
  int H, W;
  char c;
  cin >> H >> W;
  vector<vector<NODE *> > memo(H, vector<NODE *>(W, (NODE *)0));
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      cin >> c;
      if (c != '.') memo[i][j] = new NODE(c);
    }
  }
  for (int i = 0; i < H; i++) {
    NODE *prev = (NODE *)0;
    for (int j = 0; j < W; j++) {
      if (memo[i][j] != NULL) {
        memo[i][j]->l = prev;
        if (prev != NULL) prev->r = memo[i][j];
        prev = memo[i][j];
      }
    }
    prev = (NODE *)0;
    for (int j = W - 1; j >= 0; j--) {
      if (memo[i][j] != NULL) {
        memo[i][j]->r = prev;
        if (prev != NULL) prev->l = memo[i][j];
        prev = memo[i][j];
      }
    }
  }
  for (int j = 0; j < W; j++) {
    NODE *prev = (NODE *)0;
    for (int i = 0; i < H; i++) {
      if (memo[i][j] != NULL) {
        memo[i][j]->u = prev;
        if (prev != NULL) prev->d = memo[i][j];
        prev = memo[i][j];
      }
    }
    prev = (NODE *)0;
    for (int i = H - 1; i >= 0; i--) {
      if (memo[i][j] != NULL) {
        memo[i][j]->d = prev;
        if (prev != NULL) prev->u = memo[i][j];
        prev = memo[i][j];
      }
    }
  }
  int ans = 0, cnt = 0;
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      int g = f(memo[i][j]);
      if (ans == g) {
        cnt++;
      } else if (g > ans) {
        cnt = 1;
        ans = g;
      }
    }
  }
  cout << ans << " " << cnt << endl;
}
