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>
#pragma GCC optimize("O3")
using namespace std;
int n, m, bst, ci;
char z[5002][5002];
vector<int> st[5002], dr[5002], sus[5002], jos[5002];
void rid(int i, int j) {
  if (dr[i][j] != m + 1) st[i][dr[i][j]] = st[i][j];
  if (st[i][j] != 0) dr[i][st[i][j]] = dr[i][j];
  if (sus[i][j] != 0) jos[sus[i][j]][j] = jos[i][j];
  if (jos[i][j] != n + 1) sus[jos[i][j]][j] = sus[i][j];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) cin >> (z[i] + 1);
  for (int i = 1; i <= n; ++i) {
    st[i].resize(m + 2);
    dr[i].resize(m + 2);
    sus[i].resize(m + 2);
    jos[i].resize(m + 2);
  }
  for (int a = 1; a <= n; ++a)
    for (int b = 1; b <= m; ++b) {
      for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j) {
          st[i][j] = j - 1;
          dr[i][j] = j + 1;
          sus[i][j] = i - 1;
          jos[i][j] = i + 1;
        }
      for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j)
          if (z[i][j] == '.') rid(i, j);
      int x = a;
      int y = b;
      int nr = 0;
      while (1 <= x && x <= n && 1 <= y && y <= m) {
        rid(x, y);
        if (z[x][y] == 'L')
          y = st[x][y];
        else if (z[x][y] == 'U')
          x = sus[x][y];
        else if (z[x][y] == 'R')
          y = dr[x][y];
        else
          x = jos[x][y];
        ++nr;
      }
      if (nr > bst)
        bst = nr, ci = 1;
      else if (nr == bst)
        ++ci;
    }
  cout << bst << " " << ci << '\n';
  return 0;
}
