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 = 5010;
char s[N];
char mp[N];
bool v[N];
int up[N], down[N], leftt[N], rightt[N];
int sum;
queue<int> q;
int tot;
int n, m, nm;
void bfs(int t) {
  while (!q.empty()) q.pop();
  q.push(t);
  v[t] = 1;
  int flag = t;
  while (!q.empty()) {
    t = q.front();
    sum++;
    q.pop();
    int x = t;
    int tmp = x % m;
    if (tmp == 0) tmp = m;
    int liml = x - tmp + 1, limr = liml + m - 1;
    if (mp[t] == 'L') {
      while (x != 0 && v[x]) x = leftt[x];
      if (x == 0) break;
      v[x] = 1;
      q.push(x);
    } else if (mp[t] == 'R') {
      while (x != 0 && v[x]) x = rightt[x];
      if (x == 0) break;
      v[x] = 1;
      q.push(x);
    } else if (mp[t] == 'U') {
      while (x != 0 && v[x]) x = up[x];
      if (x == 0) break;
      v[x] = 1;
      q.push(x);
    } else if (mp[t] == 'D') {
      while (x != 0 && v[x]) x = down[x];
      if (x == 0) break;
      v[x] = 1;
      q.push(x);
    }
  }
}
void finds(int x) {
  int tmp = x % m;
  if (tmp == 0) tmp = m;
  int liml = x - tmp + 1, limr = liml + m - 1;
  int t = x - m;
  while (t > 0 && mp[t] == '.') t -= m;
  up[x] = t;
  t = x + m;
  while (t <= nm && mp[t] == '.') t += m;
  if (t > nm) t = 0;
  down[x] = t;
  t = x - 1;
  while (t >= liml && mp[t] == '.') t--;
  if (t < liml) t = 0;
  leftt[x] = t;
  t = x + 1;
  while (t <= limr && mp[t] == '.') t++;
  if (t > limr) t = 0;
  rightt[x] = t;
}
int main() {
  scanf("%d%d", &n, &m);
  nm = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%s", s);
    for (int j = 0; j < m; j++) mp[++nm] = s[j];
  }
  for (int i = 1; i <= nm; i++) finds(i);
  int ans = 0, t = 0;
  for (int i = 1; i <= nm; i++)
    if (mp[i] != '.') {
      memset(v, 0, sizeof(v));
      sum = 0;
      bfs(i);
      if (sum > ans) {
        ans = sum;
        t = 1;
      } else if (sum == ans)
        t++;
    }
  printf("%d %d\n", ans, t);
  return 0;
}
