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 N = 5005;
typedef struct node {
  char dir;
  int r, c;
  struct node *left, *right, *up, *down;
  node(char dir = '-', int r = -1, int c = -1) : dir(dir), r(r), c(c) {
    left = right = up = down = 0;
  }
} node;
char a[N];
int R, C;
void remove(node *x) {
  node *l = x->left;
  node *r = x->right;
  node *u = x->up;
  node *d = x->down;
  if (l) l->right = r;
  if (r) r->left = l;
  if (u) u->down = d;
  if (d) d->up = u;
}
int solve(int d) {
  node b[R][C];
  int k = 0;
  for (int i = (0), _b = (R); i < (_b); ++i)
    for (int j = (0), _b = (C); j < (_b); ++j) b[i][j] = node(a[k++], i, j);
  for (int i = (0), _b = (R); i < (_b); ++i) {
    node *prev = 0;
    for (int j = (0), _b = (C); j < (_b); ++j) {
      if (b[i][j].dir == '.') continue;
      if (!prev)
        prev = &b[i][j];
      else {
        prev->right = &b[i][j];
        b[i][j].left = prev;
        prev = &b[i][j];
      }
    }
  }
  for (int j = (0), _b = (C); j < (_b); ++j) {
    node *prev = 0;
    for (int i = (0), _b = (R); i < (_b); ++i) {
      if (b[i][j].dir == '.') continue;
      if (!prev)
        prev = &b[i][j];
      else {
        prev->down = &b[i][j];
        b[i][j].up = prev;
        prev = &b[i][j];
      }
    }
  }
  int ret = 0;
  int r = d / C, c = d % C;
  while (true) {
    char ch = b[r][c].dir;
    if (ch == 'U') {
      ++ret;
      int i = -1, j = -1;
      if (b[r][c].up) {
        i = b[r][c].up->r;
        j = b[r][c].up->c;
      }
      remove(&b[r][c]);
      if (i == -1) break;
      r = i;
      c = j;
    } else if (ch == 'D') {
      ++ret;
      int i = -1, j = -1;
      if (b[r][c].down) {
        i = b[r][c].down->r;
        j = b[r][c].down->c;
      }
      remove(&b[r][c]);
      if (i == -1) break;
      r = i;
      c = j;
    } else if (ch == 'L') {
      ++ret;
      int i = -1, j = -1;
      if (b[r][c].left) {
        i = b[r][c].left->r;
        j = b[r][c].left->c;
      }
      remove(&b[r][c]);
      if (i == -1) break;
      r = i;
      c = j;
    } else if (ch == 'R') {
      ++ret;
      int i = -1, j = -1;
      if (b[r][c].right) {
        i = b[r][c].right->r;
        j = b[r][c].right->c;
      }
      remove(&b[r][c]);
      if (i == -1) break;
      r = i;
      c = j;
    }
  }
  return ret;
}
int main(int argc, char *argv[]) {
  cin >> R >> C;
  char ch;
  for (int i = (0), _b = (R * C); i < (_b); ++i) cin >> a[i];
  int ans = 0, cnt = 0;
  for (int i = (0), _b = (R * C); i < (_b); ++i) {
    if (a[i] == '.') continue;
    int x = solve(i);
    if (x > ans) {
      ans = x;
      cnt = 1;
    } else if (x == ans)
      ++cnt;
  }
  printf("%d %d\n", ans, cnt);
  return 0;
}
