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;
string s[5010];
int n, m;
int call(int i, int j);
int main() {
  cin >> n >> m;
  string s2[5010];
  int i, j;
  for (i = 0; i < n; ++i) {
    cin >> s2[i];
    s[i] = s2[i];
  }
  int k;
  vector<int> v;
  for (i = 0; i < n; ++i) {
    for (j = 0; j < n; ++j) {
      v.push_back(call(i, j));
      for (k = 0; k < n; ++k) s[k] = s2[k];
    }
  }
  sort(v.begin(), v.end(), greater<int>());
  int cnt = 0;
  for (i = 0; i < (int)v.size(); ++i) {
    if (v[i] != v[0]) break;
    cnt++;
  }
  cout << v[0] << " " << cnt << endl;
  return 0;
}
int call(int i, int j) {
  int cnt = 0, k;
  while (1) {
    bool flag = 0;
    if (s[i][j] == 'U') {
      for (k = i - 1; k >= 0; --k) {
        if (s[k][j] != '.') {
          s[i][j] = '.';
          cnt++;
          i = k;
          flag = 1;
          break;
        }
      }
    } else if (s[i][j] == 'D') {
      for (k = i + 1; k < n; ++k) {
        if (s[k][j] != '.') {
          s[i][j] = '.';
          cnt++;
          i = k;
          flag = 1;
          break;
        }
      }
    } else if (s[i][j] == 'L') {
      for (k = j - 1; k >= 0; --k) {
        if (s[i][k] != '.') {
          s[i][j] = '.';
          cnt++;
          j = k;
          flag = 1;
          break;
        }
      }
    } else if (s[i][j] == 'R') {
      for (k = j + 1; k < m; ++k) {
        if (s[i][k] != '.') {
          s[i][j] = '.';
          cnt++;
          j = k;
          flag = 1;
          break;
        }
      }
    }
    if (!flag) break;
  }
  return cnt + 1;
}
