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>
const int N = 5010;
const int inf = 0x3f3f3f3f;
using namespace std;
int n, m;
char s[N];
int c[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
int check(char c) {
  if (c == 'U') return 0;
  if (c == 'D') return 1;
  if (c == 'L') return 2;
  if (c == 'R') return 3;
  return -1;
}
bool judge(int x, int y) {
  if (x < 0 || x >= n || y < 0 || y >= m) return 0;
  return 1;
}
int dp[N][4], vis[N], cnt[N];
int work(int f, int t, int d) {
  int &ret = dp[t][d];
  int x = ret / m, y = ret % m;
  if (s[ret] == '.' || vis[ret] == f) {
    x += c[d][0], y += c[d][1];
    if (!judge(x, y)) return ret = -1;
    ret = work(f, x * m + y, d);
  }
  return ret;
}
int dfs(int f, int t, int d) {
  int x = t / m, y = t % m;
  int ret = work(f, t, d);
  if (ret == -1) return 0;
  vis[ret] = f;
  dfs(f, ret, check(s[ret]));
  return 0;
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) cin >> s[i * m + j];
  memset(vis, -1, sizeof(vis));
  int ret = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      for (int ii = 0; ii < n; ii++)
        for (int jj = 0; jj < m; jj++)
          for (int k = 0; k < 4; k++) dp[ii * m + jj][k] = ii * m + jj;
      if (s[i * m + j] != '.')
        vis[i * m + j] = i * m + j,
                    dfs(i * m + j, i * m + j, check(s[i * m + j]));
      for (int ii = 0; ii < n; ii++)
        for (int jj = 0; jj < m; jj++)
          if (s[ii * m + jj] != '.' && vis[ii * m + jj] == i * m + j)
            cnt[i * m + j]++;
      ret = max(ret, cnt[i * m + j]);
    }
  int c = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      if (ret == cnt[i * m + j]) c++;
  cout << ret << " " << c << endl;
  return 0;
}
