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;
string map[5050];
struct Node {
  char c;
  int ans;
  Node *up, *down, *left, *right;
};
vector<Node> node[5050];
int n, m;
void buildLink() {
  for (int i = 0; i < int(n); ++i) {
    Node *nt = NULL;
    for (int j = 0; j < int(m); ++j)
      if (map[i][j] != '.') {
        if (nt) nt->right = &node[i][j];
        node[i][j].left = nt;
        nt = &node[i][j];
        nt->right = NULL;
      }
  }
  for (int j = 0; j < int(m); ++j) {
    Node *nt = NULL;
    for (int i = 0; i < int(n); ++i)
      if (map[i][j] != '.') {
        if (nt) nt->down = &node[i][j];
        node[i][j].up = nt;
        nt = &node[i][j];
        nt->down = NULL;
      }
  }
}
int dfs(Node *nt, int dep) {
  if (dep > n * m) return dep;
  if (nt->c == 'U') {
    if (nt->up) {
      nt->up->down = nt->down;
      if (nt->down) nt->down->up = nt->up;
      if (nt->left) nt->left->right = nt->right;
      if (nt->right) nt->right->left = nt->left;
      return dfs(nt->up, dep + 1);
    }
    return dep;
  } else if (nt->c == 'D') {
    if (nt->down) {
      nt->down->up = nt->up;
      if (nt->up) nt->up->down = nt->down;
      if (nt->left) nt->left->right = nt->right;
      if (nt->right) nt->right->left = nt->left;
      return dfs(nt->down, dep + 1);
    }
    return dep;
  } else if (nt->c == 'L') {
    if (nt->left) {
      nt->left->right = nt->right;
      if (nt->up) nt->up->down = nt->down;
      if (nt->down) nt->down->up = nt->up;
      if (nt->right) nt->right->left = nt->left;
      return dfs(nt->left, dep + 1);
    }
    return dep;
  } else {
    if (nt->right) {
      nt->right->left = nt->left;
      if (nt->up) nt->up->down = nt->down;
      if (nt->down) nt->down->up = nt->up;
      if (nt->left) nt->left->right = nt->right;
      return dfs(nt->right, dep + 1);
    }
    return dep;
  }
}
int main() {
  while (cin >> n >> m) {
    for (int i = 0; i < int(n); ++i) cin >> map[i];
    for (int i = 0; i < int(n); ++i)
      for (int j = 0; j < int(m); ++j) {
        node[i].push_back(*new Node);
        node[i][j].c = map[i][j];
      }
    int tmax = -1;
    for (int i = 0; i < int(n); ++i)
      for (int j = 0; j < int(m); ++j)
        if (map[i][j] != '.') {
          buildLink();
          node[i][j].ans = dfs(&node[i][j], 1);
          tmax = max(tmax, node[i][j].ans);
        }
    int cnt = 0;
    for (int i = 0; i < int(n); ++i)
      for (int j = 0; j < int(m); ++j)
        if (node[i][j].ans == tmax) cnt++;
    cout << tmax << " " << cnt << endl;
  }
  return 0;
}
