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 H = 5010;
char a[H][H];
int mark[H][H];
int n, m;
set<int> row[H], col[H];
int dfs(int i, int j) {
  int temp;
  col[j].erase(i);
  row[i].erase(j);
  if (a[i][j] == 'D') {
    if (col[j].lower_bound(i) == col[j].end()) {
      return 0;
    }
    temp = *col[j].lower_bound(i);
    return dfs(temp, j) + 1;
  } else if (a[i][j] == 'U') {
    set<int>::iterator p = col[j].lower_bound(i);
    if (p == col[j].end() && col[j].size() == 0) {
      return 0;
    }
    p--;
    temp = *p;
    return dfs(temp, j) + 1;
  } else if (a[i][j] == 'L') {
    set<int>::iterator p = row[i].lower_bound(j);
    if (p == row[i].end() && row[i].size() == 0) {
      return 0;
    }
    p--;
    temp = *p;
    return dfs(i, temp) + 1;
  } else if (a[i][j] == 'R') {
    if (row[i].lower_bound(j) == row[i].end()) {
      return 0;
    }
    temp = *row[i].lower_bound(j);
    return dfs(i, temp) + 1;
  }
  return 0;
}
void zero() {
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      mark[i][j] = 0;
      if (isalpha(a[i][j])) {
        row[i].insert(j);
        col[j].insert(i);
      }
    }
  }
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> a[i][j];
    }
  }
  int out = 0;
  int num = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (a[i][j] == '.') {
        continue;
      }
      zero();
      int temp = dfs(i, j);
      if (out == temp) {
        num++;
      } else if (out < temp) {
        out = temp;
        num = 1;
      }
    }
  }
  cout << out + 1 << " " << num << endl;
  return 0;
}
