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** ar;
char** fish;
int n, m;
int start = 0;
int loop = 0;
int dsjfkjsdfkjsdkfjk;
int n_max;
int t;
int work(int x, int y) {
  int x1 = x, y1 = y;
  int st = 0;
  if (!start) st = start = 1;
  char t = ar[y][x];
  ar[y][x] = '.';
  if (st) ar[y][x] = '0';
  int res;
  if (t == 'D') {
    ++y;
    while (y < n) {
      if (ar[y][x] != '.') {
        if (ar[y][x] == '0')
          loop = 1;
        else {
          res = work(x, y);
          break;
        }
      }
      ++y;
    }
    if (y == n) res = 0;
  } else if (t == 'U') {
    --y;
    while (y >= 0) {
      if (ar[y][x] != '.') {
        if (ar[y][x] == '0')
          loop = 1;
        else {
          res = work(x, y);
          break;
        }
      }
      --y;
    }
    if (y < 0) res = 0;
  } else if (t == 'R') {
    ++x;
    while (x < m) {
      if (ar[y][x] != '.') {
        if (ar[y][x] == '0')
          loop = 1;
        else {
          res = work(x, y);
          break;
        }
      }
      ++x;
    }
    if (x == m) res = 0;
  } else if (t == 'L') {
    --x;
    while (x >= 0) {
      if (ar[y][x] != '.') {
        if (ar[y][x] == '0')
          loop = 1;
        else {
          res = work(x, y);
          break;
        }
      }
      --x;
    }
    if (x < 0) res = 0;
  }
  ar[y1][x1] = t;
  if (st) {
    start = 0;
    loop = 0;
  }
  if (!loop) {
    fish[y1][x1] = 1;
  }
  return res + 1;
}
int main(int argc, char** argv) {
  cin >> n >> m;
  dsjfkjsdfkjsdkfjk = n_max = 0;
  t = 0;
  ar = new char*[n];
  fish = new char*[n];
  for (int i = 0; i < n; ++i) {
    ar[i] = new char[m];
    fish[i] = new char[m];
  }
  for (int i = 0; i < n; ++i) {
    getchar();
    for (int j = 0; j < m; ++j) {
      ar[i][j] = getchar();
      fish[i][j] = 0;
    }
  }
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; ++j) {
      if (ar[i][j] != '.' && !fish[i][j]) t = work(j, i);
      if (t == dsjfkjsdfkjsdkfjk) ++n_max;
      if (t > dsjfkjsdfkjsdkfjk) {
        dsjfkjsdfkjsdkfjk = t;
        n_max = 1;
      }
      t = 0;
    }
  cout << dsjfkjsdfkjsdkfjk << " " << n_max;
  return 0;
}
