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;
vector<int> used;
vector<vector<int> > g;
void dfs(int v, int pr) {
  used[v] = 1;
  for (int i = 0; i < g[v].size(); ++i) {
    if (used[g[v][i]] == 0) {
      dfs(g[v][i], v);
    }
    if (used[g[v][i]] + 1 > used[v] && g[v][i] != pr) {
      used[v] = used[g[v][i]] + 1;
    }
  }
}
int main() {
  int n, m;
  cin >> n >> m;
  used.resize(n * m);
  g.resize(n * m);
  vector<vector<int> > matr(n, vector<int>(m));
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      char z;
      cin >> z;
      if (z == '.') {
        matr[i][j] = -1;
        used[i * m + j] = -1;
      } else if (z == 'D') {
        matr[i][j] = 2;
      } else if (z == 'U') {
        matr[i][j] = 8;
      } else if (z == 'L') {
        matr[i][j] = 4;
      } else
        matr[i][j] = 6;
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      if (matr[i][j] == 2) {
        for (int z = i + 1; z < n; ++z) {
          if (matr[z][j] != -1) g[i * m + j].push_back(z * m + j);
        }
      }
      if (matr[i][j] == 4) {
        for (int z = j - 1; z >= 0; --z) {
          if (matr[i][z] != -1) g[i * m + j].push_back(i * m + z);
        }
      }
      if (matr[i][j] == 8) {
        for (int z = i - 1; z >= 0; --z) {
          if (matr[z][j] != -1) g[i * m + j].push_back(z * m + j);
        }
      }
      if (matr[i][j] == 6) {
        for (int z = j + 1; z < m; ++z) {
          if (matr[i][z] != -1) g[i * m + j].push_back(i * m + z);
        }
      }
    }
  }
  for (int i = 0; i < n * m; ++i) {
    if (used[i] == 0) {
      dfs(i, -1);
    }
  }
  int max = -1;
  int countmax = 0;
  for (int i = 0; i < n * m; ++i) {
    if (used[i] > max) {
      max = used[i];
      countmax = 1;
    } else if (used[i] == max) {
      countmax++;
    }
  }
  cout << max << ' ' << countmax;
}
