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;
char f[5000][5000];
char S[5000][5000] = {};
int F[5000][2], l = 0;
char deleted[5000][5000] = {};
int i, j, n, m, h, x, y, dx, dy;
int maxturn = 0, turn = 0, number = 1;
void SetDirection() {
  if (f[y][x] == 'U') {
    dx = 0;
    dy = -1;
  }
  if (f[y][x] == 'D') {
    dx = 0;
    dy = 1;
  }
  if (f[y][x] == 'L') {
    dx = -1;
    dy = 0;
  }
  if (f[y][x] == 'R') {
    dx = 1;
    dy = 0;
  }
}
void Clear() {
  int i, j;
  for (i = 0; i < n; i++)
    for (j = 0; j < m; j++) {
      deleted[i][j] = 0;
    }
}
int main() {
  cin >> n >> m;
  for (i = 0; i < n; i++)
    for (j = 0; j < m; j++) {
      cin >> f[i][j];
      if (f[i][j] == '.')
        S[i][j] = -1;
      else {
        F[l][0] = i;
        F[l][1] = j;
        l++;
      }
    }
  for (h = 0; h < l; h++) {
    y = F[h][0];
    x = F[h][1];
    if (S[y][x] == 0) {
      turn = 0;
      if (turn > maxturn) {
        maxturn = turn;
        number = 0;
      }
      if (turn == maxturn) number++;
      SetDirection();
      S[y][x] = 1;
      deleted[y][x] = 1;
      while (y > -1 && y < n && x > -1 && x < m) {
        y += dy;
        x += dx;
        if (x == m || y == n || x == -1 || y == -1) break;
        if (S[y][x] != -1 && deleted[y][x] == 0) {
          S[y][x] = 1;
          deleted[y][x] = 1;
          turn++;
          if (turn > maxturn) {
            maxturn = turn;
            number = 0;
          }
          if (turn == maxturn) number++;
          SetDirection();
        }
      }
      Clear();
    }
  }
  cout << maxturn + 1 << ' ' << number << endl;
  return 0;
}
