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 N = 5e3 + 5;
int n, m, mx, c, kam;
vector<vector<char> > a, tmp;
vector<vector<int> > up, down, l, r, tmpu, tmpd, tmpl, tmpr;
void cpy() {
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      tmp[i][j] = a[i][j];
      tmpu[i][j] = up[i][j];
      tmpd[i][j] = down[i][j];
      tmpl[i][j] = l[i][j];
      tmpr[i][j] = r[i][j];
    }
  }
}
bool valid(int x) { return x != n + m; }
void solve(int i, int j) {
  int c = 0;
  while (i != n + m && j != n + m) {
    c++;
    if (valid(tmpu[i][j])) tmpd[tmpu[i][j]][j] = tmpd[i][j];
    if (valid(tmpd[i][j])) tmpu[tmpd[i][j]][j] = tmpu[i][j];
    if (valid(tmpl[i][j])) tmpr[i][tmpl[i][j]] = tmpr[i][j];
    if (valid(tmpr[i][j])) tmpl[i][tmpr[i][j]] = tmpl[i][j];
    if (tmp[i][j] == 'U') {
      i = tmpu[i][j];
    } else if (tmp[i][j] == 'D') {
      i = tmpd[i][j];
    } else if (tmp[i][j] == 'L') {
      j = tmpl[i][j];
    } else {
      j = tmpr[i][j];
    }
  }
  if (c == mx)
    kam++;
  else if (c > mx) {
    mx = c;
    kam = 1;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  up = down = r = l = tmpl = tmpr = tmpu = tmpd =
      vector<vector<int> >(n + 5, vector<int>(m + 5));
  a = tmp = vector<vector<char> >(n + 5, vector<char>(m + 5));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> a[i][j];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      up[i][j] = down[i][j] = l[i][j] = r[i][j] = n + m;
      if (a[i][j] != '.') {
        int x = i - 1;
        while (x >= 0 && a[x][j] == '.') x--;
        if (x >= 0) up[i][j] = x;
        x = i + 1;
        while (x < n && a[x][j] == '.') x++;
        if (x < n) down[i][j] = x;
        x = j - 1;
        while (x >= 0 && a[i][x] == '.') x--;
        if (x >= 0) l[i][j] = x;
        x = j + 1;
        while (x < m && a[i][x] == '.') x++;
        if (x < m) r[i][j] = x;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (a[i][j] == '.') continue;
      cpy();
      solve(i, j);
    }
  }
  cout << mx << ' ' << kam << '\n';
  return 0;
}
