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 SIZE = 5010;
set<int> cells[2][SIZE];
string grid[SIZE];
int R, C;
char ch[4] = {'U', 'D', 'L', 'R'};
int dir[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
int best = 0, cnt = 0;
void go(int r, int c, int s) {
  int d = find(ch, ch + 4, grid[r][c]) - ch;
  if (s + 1 > best) {
    best = s + 1;
    cnt = 1;
  } else if (s + 1 == best)
    cnt++;
  if (d < 2) {
    set<int>::iterator itr = cells[1][c].find(r);
    if (d == 0) {
      if (itr != cells[1][c].begin()) {
        itr--;
        int rr = *itr;
        cells[1][c].erase(r);
        cells[0][r].erase(c);
        go(rr, c, s + 1);
        cells[1][c].insert(r);
        cells[0][r].insert(c);
      }
    } else {
      itr++;
      if (itr != cells[1][c].end()) {
        int rr = *itr;
        cells[1][c].erase(r);
        cells[0][r].erase(c);
        go(rr, c, s + 1);
        cells[1][c].insert(r);
        cells[0][r].insert(c);
      }
    }
  } else {
    set<int>::iterator itr = cells[0][r].find(c);
    if (d == 2) {
      if (itr != cells[0][r].begin()) {
        itr--;
        int cc = *itr;
        cells[0][r].erase(c);
        cells[1][c].erase(r);
        go(r, cc, s + 1);
        cells[0][r].insert(c);
        cells[1][c].insert(r);
      }
    } else {
      itr++;
      if (itr != cells[0][r].end()) {
        int cc = *itr;
        cells[0][r].erase(c);
        cells[1][c].erase(r);
        go(r, cc, s + 1);
        cells[0][r].insert(c);
        cells[1][c].insert(r);
      }
    }
  }
}
int main() {
  cin >> R >> C;
  for (int i = 0; i < R; i++) {
    cin >> grid[i];
    for (int j = 0; j < C; j++) {
      if (grid[i][j] == '.') continue;
      cells[0][i].insert(j);
      cells[1][j].insert(i);
    }
  }
  for (int i = 0; i < R; i++)
    for (int j = 0; j < C; j++) {
      if (grid[i][j] == '.') continue;
      if (grid[i][j] == 'U' && i + 1 < R && grid[i + 1][j] == 'U') continue;
      if (grid[i][j] == 'D' && i - 1 >= 0 && grid[i - 1][j] == 'D') continue;
      if (grid[i][j] == 'L' && j + 1 < C && grid[i][j + 1] == 'L') continue;
      if (grid[i][j] == 'R' && j - 1 >= 0 && grid[i][j - 1] == 'R') continue;
      go(i, j, 0);
    }
  cout << best << " " << cnt << endl;
  return 0;
}
