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 MAXN = 5005;
int n, m, cnt;
int u[MAXN], d[MAXN], l[MAXN], r[MAXN];
char c[MAXN];
string mat[MAXN];
bool check(int x, int y) { return (x >= 0 && x < n && y >= 0 && y < m); }
int id(int x, int y) { return check(x, y) ? x * m + y : -1; }
void add(int k) {
  u[d[k]] = k;
  d[u[k]] = k;
  l[r[k]] = k;
  r[l[k]] = k;
}
void del(int k) {
  u[d[k]] = u[k];
  d[u[k]] = d[k];
  l[r[k]] = l[k];
  r[l[k]] = r[k];
}
void build() {
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      int k = id(i, j);
      u[k] = id(i - 1, j);
      d[k] = id(i + 1, j);
      l[k] = id(i, j - 1);
      r[k] = id(i, j + 1);
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      int k = id(i, j);
      if (c[k] == '.') {
        del(k);
      }
    }
  }
}
int gao(int k) {
  if (k == -1) return 0;
  int next = -1;
  if (c[k] == 'U') next = u[k];
  if (c[k] == 'D') next = d[k];
  if (c[k] == 'L') next = l[k];
  if (c[k] == 'R') next = r[k];
  del(k);
  int mov = gao(next) + 1;
  add(k);
  return mov;
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; ++i) {
    cin >> mat[i];
    for (int j = 0; j < m; ++j) {
      c[id(i, j)] = mat[i][j];
    }
  }
  build();
  int ans = 0, cnt = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      if (mat[i][j] != '.') {
        int tmp = gao(id(i, j));
        if (ans < tmp)
          ans = tmp, cnt = 1;
        else if (ans == tmp)
          ++cnt;
      }
    }
  }
  cout << ans - 1 << " " << cnt << endl;
}
