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;
template <class T>
T abs(T x) {
  return x > 0 ? x : -x;
}
const int dx[4] = {0, -1, 0, 1};
const int dy[4] = {-1, 0, 1, 0};
int n;
int m;
string g[5000];
int v[5000][4], t[5000];
int was[5000];
int ct;
int go(int i, int j, int t) {
  if (i < 0 || j < 0 || i >= n || j >= m) return 0;
  if (was[i * m + j] != ct && g[i][j] != '.') return 0;
  return v[i * m + j][t] = v[i * m + j][t] + go(i + dx[t] * v[i * m + j][t],
                                                j + dy[t] * v[i * m + j][t], t);
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) cin >> g[i];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      t[i * m + j] = int(g[i][j] == 'U') + 2 * int(g[i][j] == 'R') +
                     3 * int(g[i][j] == 'D') + 4 * int(g[i][j] == '.');
  int ans = 0, cnt = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      if (g[i][j] != '.') {
        for (int a = 0; a < n; a++)
          for (int b = 0; b < m; b++)
            for (int k = 0; k < 4; k++) v[a * m + b][k] = 1;
        ct++;
        int a = i, b = j, cur = 0;
        while (true) {
          cur++;
          was[a * m + b] = ct;
          int tt = t[a * m + b];
          int d = go(a, b, tt);
          if (a + dx[tt] * d < 0 || a + dx[tt] * d >= n || b + dy[tt] * d < 0 ||
              b + dy[tt] * d >= m)
            break;
          a += dx[tt] * d;
          b += dy[tt] * d;
        }
        if (cur > ans) ans = cur, cnt = 0;
        if (cur == ans) cnt++;
      }
  printf("%d %d\n", ans, cnt);
  return 0;
}
