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;
short was[5005][5005][2];
bool used[5005][5005];
char buf[5005][5005];
int n, m;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int DFS(int x1, int y1) {
  int x = x1, y = y1;
  used[x][y] = true;
  int dir;
  if (buf[x][y] == 'U') {
    dir = 3;
  } else if (buf[x][y] == 'D') {
    dir = 1;
  } else if (buf[x][y] == 'L') {
    dir = 2;
  } else {
    dir = 0;
  }
  while (x > -1 && y > -1 && x < n && y < m &&
         (used[x][y] || buf[x][y] == '.')) {
    if (buf[x][y] == buf[x1][y1] && was[x][y][0] != -1) {
      x = was[x][y][0] + dx[dir];
      y = was[x][y][1] + dy[dir];
    } else {
      x += dx[dir];
      y += dy[dir];
    }
  }
  if (x > -1 && y > -1 && x < n && y < m) {
    was[x1][y1][0] = x;
    was[x1][y1][1] = y;
    int ret = 1 + DFS(x, y);
    used[x1][y1] = false;
    was[x1][y1][0] = -1;
    was[x1][y1][1] = -1;
    return ret;
  } else {
    used[x1][y1] = false;
    return 1;
  }
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> buf[i];
  }
  memset(was, -1, sizeof was);
  int q = 0, mx = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (buf[i][j] == '.') {
        continue;
      }
      int ans = DFS(i, j);
      if (ans > mx) {
        mx = ans;
        q = 1;
      } else if (ans == mx) {
        q++;
      }
    }
  }
  cout << mx << " " << q << endl;
  return 0;
}
