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 neighb {
  int L, R, U, D;
};
const int MX = 5009;
char c[MX][MX];
neighb a_orig[3 * MX];
neighb a[3 * MX];
int n, m;
int n_clamp;
void del(int i, int j) {
  int v = i * n_clamp + j;
  int vb = i * n_clamp;
  a[vb + a[v].L].R = a[v].R;
  a[vb + a[v].R].L = a[v].L;
  a[a[v].U * n_clamp + j].D = a[v].D;
  a[a[v].D * n_clamp + j].U = a[v].U;
}
int solve(int iii, int jjj) {
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) a[i * n_clamp + j] = a_orig[i * n_clamp + j];
  }
  int result = 1;
  while (true) {
    int v = iii * n_clamp + jjj;
    del(iii, jjj);
    char cc = c[iii][jjj];
    switch (cc) {
      case 'U':
        iii = a[v].U;
        break;
      case 'D':
        iii = a[v].D;
        break;
      case 'L':
        jjj = a[v].L;
        break;
      case 'R':
        jjj = a[v].R;
        break;
    }
    if (1 <= iii && iii <= n && 1 <= jjj && jjj <= m)
      ;
    else
      break;
    result++;
  }
  return result;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> m;
  n_clamp = n + 2;
  for (int i = 1; i <= n; i++) {
    cin >> (c[i] + 1);
  }
  for (int i = 1; i <= n; i++) {
    int prev = 0;
    for (int j = 1; j <= m; j++) {
      a_orig[i * n_clamp + j].L = prev;
      if (c[i][j] != '.') prev = j;
    }
    prev = m + 1;
    for (int j = m; j >= 1; j--) {
      a_orig[i * n_clamp + j].R = prev;
      if (c[i][j] != '.') prev = j;
    }
  }
  for (int j = 1; j <= m; j++) {
    int prev = 0;
    for (int i = 1; i <= m; i++) {
      a_orig[i * n_clamp + j].U = prev;
      if (c[i][j] != '.') prev = i;
    }
    prev = n + 1;
    for (int i = n; i >= 1; i--) {
      a_orig[i * n_clamp + j].D = prev;
      if (c[i][j] != '.') prev = i;
    }
  }
  int result = 0, cnt = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (c[i][j] != '.') {
        int temp = solve(i, j);
        if (temp > result) {
          result = temp;
          cnt = 1;
        } else if (temp == result)
          cnt++;
      }
    }
  }
  cout << result << ' ' << cnt;
  return 0;
}
