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;
int N, M, cnt;
string S;
int Mat[5001][5001];
int Adj[5001][5001];
void dfs(int, int);
int main() {
  cin >> N >> M;
  for (int i = 0; i < N; ++i) {
    cin >> S;
    for (int j = 0; j < M; ++j) {
      if (S[j] == 'L') {
        Mat[i][j] = 1;
        Adj[i][j] = 1;
      }
      if (S[j] == 'D') {
        Mat[i][j] = 2;
      }
      if (S[j] == 'R') {
        Mat[i][j] = 3;
      }
      if (S[j] == 'U') {
        Mat[i][j] = 4;
      }
      if (S[j] == '.') {
        Mat[i][j] = 0;
      }
    }
  }
  int max = 0, res = 0;
  vector<int> ans;
  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < M; ++j) {
      if (Mat[i][j] != 0) {
        memset(Adj, 0, sizeof(Adj));
        cnt = 1;
        if (i == 0 && Mat[i][j] == 4) continue;
        if (j == 0 && Mat[i][j] == 1) continue;
        if (i == N - 1 && Mat[i][j] == 3) continue;
        if (j == M - 1 && Mat[i][j] == 2) continue;
        dfs(i, j);
        if (cnt >= max) {
          if (cnt == max) res++;
          if (cnt > max) res = 1;
          max = cnt;
        }
      }
    }
  }
  cout << max << " " << res << endl;
  return 0;
}
void dfs(int row, int col) {
  Adj[row][col] = 1;
  if (Mat[row][col] == 1) {
    for (int j = col; j >= 0; j--)
      if (Adj[row][j] == 0 && Mat[row][j] > 0) {
        cnt++;
        dfs(row, j);
        return;
      }
  }
  if (Mat[row][col] == 3) {
    for (int j = col; j < M; j++)
      if (Adj[row][j] == 0 && Mat[row][j] > 0) {
        cnt++;
        dfs(row, j);
        return;
      }
  }
  if (Mat[row][col] == 2) {
    for (int i = row; i < N; i++)
      if (Adj[i][col] == 0 && Mat[i][col] > 0) {
        cnt++;
        dfs(i, col);
        return;
      }
  }
  if (Mat[row][col] == 4) {
    for (int i = row; i >= 0; i--)
      if (Adj[i][col] == 0 && Mat[i][col] > 0) {
        cnt++;
        dfs(i, col);
        return;
      }
  }
}
