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;
void solvetask() {
  int n, m;
  cin >> n >> m;
  int a[n][m];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      char c;
      cin >> c;
      if (c == '.')
        a[i][j] = 0;
      else if (c == 'U')
        a[i][j] = 1;
      else if (c == 'R')
        a[i][j] = 2;
      else if (c == 'D')
        a[i][j] = 3;
      else if (c == 'L')
        a[i][j] = 4;
    }
  }
  int nextd[n][m][5], next[n][m][5];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      int ans = -1;
      nextd[i][j][0] = -1;
      for (int ii = i - 1; ii >= 0; ii--)
        if (a[ii][j]) {
          ans = ii;
          break;
        }
      nextd[i][j][1] = ans;
      ans = -1;
      for (int ii = i + 1; ii < m; ii++)
        if (a[ii][j]) {
          ans = ii;
          break;
        }
      nextd[i][j][3] = ans;
      ans = -1;
      for (int jj = j + 1; jj < m; jj++)
        if (a[i][jj]) {
          ans = jj;
          break;
        }
      nextd[i][j][2] = ans;
      ans = -1;
      for (int jj = j - 1; jj >= 0; jj--)
        if (a[i][jj]) {
          ans = jj;
          break;
        }
      nextd[i][j][4] = ans;
    }
  }
  int ans = 0, cnt = 0;
  for (int ii = 0; ii < n; ii++) {
    for (int jj = 0; jj < m; jj++) {
      for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
          for (int k = 0; k < 5; k++) next[i][j][k] = nextd[i][j][k];
      int i = ii, j = jj, cur = 0;
      while (next[i][j][a[i][j]] != -1) {
        cur++;
        if (next[i][j][4] != -1) next[i][next[i][j][4]][2] = next[i][j][2];
        if (next[i][j][2] != -1) next[i][next[i][j][2]][4] = next[i][j][4];
        if (next[i][j][1] != -1) next[next[i][j][1]][j][3] = next[i][j][3];
        if (next[i][j][3] != -1) next[next[i][j][3]][j][1] = next[i][j][1];
        if (a[i][j] == 1 || a[i][j] == 3)
          i = next[i][j][a[i][j]];
        else
          j = next[i][j][a[i][j]];
      }
      if (cur > ans) {
        ans = cur;
        cnt = 1;
      } else if (cur == ans)
        cnt++;
    }
  }
  cout << ans + 1 << " " << cnt << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t = 1;
  while (t--) solvetask();
}
