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 INF = 0x7FFFFFFF;
const double eps = 1e-10;
const double pi = acos(-1.0);
const int maxn = 5001;
int n, m, tot, ans, anstot;
vector<int> g[maxn];
bool vis[maxn], can[maxn];
char a[maxn][maxn];
int b[maxn][maxn];
int indu[maxn];
void init() {
  cin >> n >> m;
  tot = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    for (int j = 0; j < m; j++)
      if (a[i][j] != '.') b[i][j] = ++tot;
  }
  memset(g, 0, sizeof(g));
  memset(indu, 0, sizeof(indu));
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      if (a[i][j] != '.') {
        if (a[i][j] == 'L') {
          for (int k = j - 1; k >= 0; k--)
            if (b[i][k] != 0) {
              g[b[i][j]].push_back(b[i][k]);
              indu[b[i][k]]++;
            }
        } else if (a[i][j] == 'R') {
          for (int k = j + 1; k < m; k++)
            if (b[i][k] != 0) {
              g[b[i][j]].push_back(b[i][k]);
              indu[b[i][k]]++;
            }
        } else if (a[i][j] == 'D') {
          for (int k = i + 1; k < n; k++)
            if (b[k][j] != 0) {
              g[b[i][j]].push_back(b[k][j]);
              indu[b[k][j]]++;
            }
        } else {
          for (int k = i - 1; k >= 0; k--)
            if (b[k][j] != 0) {
              g[b[i][j]].push_back(b[k][j]);
              indu[b[k][j]]++;
            }
        }
      }
  memset(can, 0, sizeof(can));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++)
      if (a[i][j] == 'R') {
        can[b[i][j]] = true;
        break;
      }
    for (int j = m - 1; j >= 0; j--)
      if (a[i][j] == 'L') {
        can[b[i][j]] = true;
        break;
      }
  }
  for (int j = 0; j < m; j++) {
    for (int i = 0; i < n; i++)
      if (a[i][j] == 'D') {
        can[b[i][j]] = true;
        break;
      }
    for (int i = n - 1; i >= 0; i--)
      if (a[i][j] == 'U') {
        can[b[i][j]] = true;
        break;
      }
  }
}
void solve() {
  int ans = 0;
  for (int i = 1; i <= tot; i++)
    if (can[i]) {
      memset(vis, 0, sizeof(vis));
      vis[i] = true;
      int now = 1, x = i;
      while (true) {
        bool flag = false;
        for (int j = 0; j < g[x].size(); j++)
          if (!vis[g[x][j]]) {
            vis[g[x][j]] = true;
            x = g[x][j];
            ++now;
            flag = true;
            break;
          }
        if (!flag) break;
      }
      if (now > ans) {
        ans = now;
        anstot = 1;
      } else if (now == ans)
        ++anstot;
    }
  cout << ans << ' ' << anstot << endl;
}
int main() {
  init();
  solve();
  return 0;
}
