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 = 5000;
const int Maxd = 4;
const string dir = "LURD.";
struct pos {
  int c;
  pair<int, int> to[Maxd];
};
int n, m;
vector<pos> B[Maxn];
int res, cnt;
void Try(int r, int c, int col) {
  if (r == -1 || c == -1) {
    if (col == res)
      cnt++;
    else if (col > res) {
      res = col;
      cnt = 1;
    }
  } else {
    for (int i = 0; i < Maxd; i++) {
      pair<int, int> p = B[r][c].to[i];
      if (p.first != -1 && p.second != -1)
        B[p.first][p.second].to[(i + 2) % Maxd] = B[r][c].to[(i + 2) % Maxd];
    }
    int wh = B[r][c].c;
    Try(B[r][c].to[wh].first, B[r][c].to[wh].second, col + 1);
    for (int i = 0; i < Maxd; i++) {
      pair<int, int> p = B[r][c].to[i];
      if (p.first != -1 && p.second != -1)
        B[p.first][p.second].to[(i + 2) % Maxd] = make_pair(r, c);
    }
  }
}
int main() {
  cin >> n >> m;
  cin.ignore();
  for (int i = 0; i < n; i++) {
    B[i].resize(m);
    for (int j = 0; j < m; j++) {
      char c;
      cin >> c;
      B[i][j].c = dir.find(c);
    }
  }
  for (int i = 0; i < n; i++) {
    int st = -1;
    for (int j = 0; j < m; j++)
      if (B[i][j].c != Maxd) {
        B[i][j].to[0] = make_pair(i, st);
        st = j;
      }
    st = -1;
    for (int j = m - 1; j >= 0; j--)
      if (B[i][j].c != Maxd) {
        B[i][j].to[2] = make_pair(i, st);
        st = j;
      }
  }
  for (int j = 0; j < m; j++) {
    int st = -1;
    for (int i = 0; i < n; i++)
      if (B[i][j].c != Maxd) {
        B[i][j].to[1] = make_pair(st, j);
        st = i;
      }
    st = -1;
    for (int i = n - 1; i >= 0; i--)
      if (B[i][j].c != Maxd) {
        B[i][j].to[3] = make_pair(st, j);
        st = i;
      }
  }
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      if (B[i][j].c != Maxd) Try(i, j, 0);
  cout << res << " " << cnt << endl;
  return 0;
}
