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 s[5002];
vector<vector<int> > v;
int n, m, t;
int a[5002];
char *pat = "LRUD.";
int dx[] = {0, 0, -1, 1};
int dy[] = {-1, 1, 0, 0};
bool vis[5002];
int cnt[5002];
int dp[5002];
int go(int t) {
  int i, j, f = -1;
  if (dp[t] != -1) return dp[t];
  vis[t] = 1;
  int aa = -1;
  for (i = 0; i < (int)v[t].size(); i++) {
    if (vis[v[t][i]]) {
      ;
    } else {
      f = v[t][i];
      aa = max(aa, go(f));
    }
  }
  if (aa == -1) return dp[t] = 0;
  return dp[t] = 1 + aa;
}
int main() {
  int i, j, k;
  scanf("%d%d", &n, &m);
  t = n * m;
  v.resize(t + 5);
  for (i = 0; i < n; i++) {
    cin >> s[i];
    for (j = 0; j < m; j++) {
      a[i * m + j] = strchr(pat, s[i][j]) - pat;
    }
  }
  for (i = 0; i < t; i++) {
    if (a[i] == 4) continue;
    int x = i / m, y = i % m;
    while (1) {
      x += dx[a[i]];
      y += dy[a[i]];
      if (x < 0 || x >= n || y < 0 || y >= m) break;
      if (a[x * m + y] == 4) continue;
      v[i].push_back(x * m + y);
    }
  }
  int mx = 0, cnt = 0;
  vector<vector<int> > ttt = v;
  for (i = 0; i < t; i++) {
    memset(vis, 0, sizeof(vis));
    memset(dp, -1, sizeof(dp));
    vis[i] = 1;
    int tt = go(i) + 1;
    if (tt > mx) {
      mx = tt;
      cnt = 1;
    } else if (tt == mx) {
      cnt++;
    }
  }
  printf("%d %d\n", mx, cnt);
  return 0;
}
