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;
struct p {
  int l, r, u, d;
  p() {
    l = -1;
    u = -1;
    r = 5042;
    d = 5042;
  }
} a[2042][2042];
int n, m, ansC, ansL;
char input[5042][5042];
void rem(int i, int j) {
  if (a[i][j].l != -1) {
    a[i][a[i][j].l].r = a[i][j].r;
  }
  if (a[i][j].r != 5042) {
    a[i][a[i][j].r].l = a[i][j].l;
  }
  if (a[i][j].u != -1) {
    a[a[i][j].u][j].d = a[i][j].d;
  }
  if (a[i][j].d != 5042) {
    a[a[i][j].d][j].u = a[i][j].u;
  }
}
void add(int i, int j, p crr) {
  if (crr.l != -1) {
    a[i][crr.l].r = j;
  }
  if (crr.r != 5042) {
    a[i][crr.r].l = j;
  }
  if (crr.u != -1) {
    a[crr.u][j].d = i;
  }
  if (crr.d != 5042) {
    a[crr.d][j].u = i;
  }
}
void pre() {
  for (int y = 0; y < n; y++) {
    int x = 0;
    for (; x < m && input[y][x] == '.'; x++) {
    }
    for (; x < m;) {
      int x2 = x + 1;
      for (; x2 < m && input[y][x2] == '.'; x2++) {
      }
      if (x2 != m) {
        a[y][x].r = x2;
        a[y][x2].l = x;
      }
      x = x2;
    }
  }
  for (int x = 0; x < m; x++) {
    int y = 0;
    for (; y < n && input[y][x] == '.'; y++) {
    }
    for (; y < n; y++) {
      int y2 = y + 1;
      for (; y2 < n && input[y2][x] == '.'; y2++) {
      }
      if (y2 != n) {
        a[y][x].d = y2;
        a[y2][x].u = y;
      }
    }
  }
}
int dfs(int y, int x) {
  if (y == -1 || x == -1 || x == 5042 || y == 5042) {
    return 0;
  }
  p crr = a[y][x];
  rem(y, x);
  int ret;
  if (input[y][x] == 'U') {
    ret = dfs(crr.u, x);
  }
  if (input[y][x] == 'D') {
    ret = dfs(crr.d, x);
  }
  if (input[y][x] == 'L') {
    ret = dfs(y, crr.l);
  }
  if (input[y][x] == 'R') {
    ret = dfs(y, crr.r);
  }
  add(y, x, crr);
  return ret + 1;
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> input[i];
  }
  pre();
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (input[i][j] == '.') {
        continue;
      }
      int crr = dfs(i, j);
      if (crr > ansL) {
        ansL = crr;
        ansC = 0;
      }
      if (crr == ansL) {
        ansC++;
      }
    }
  }
  cout << ansL << " " << ansC << "\n";
  return 0;
}
