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>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
struct fr {
  int up;
  int down;
  int left;
  int right;
};
int n, m, ans = 0, kol = 1, an = 0;
vector<vector<char>> x;
vector<vector<fr>> pos, cpos;
int main() {
  cin >> n >> m;
  x.resize(n);
  pos.resize(n);
  cpos.resize(n);
  for (int i = 0; i < (int)(n); i++) {
    x[i].resize(m);
    pos[i].resize(m);
    cpos[i].resize(m);
    for (int j = 0; j < (int)(m); j++) cin >> x[i][j];
  }
  for (int i = 0; i < (int)(n); i++)
    for (int j = 0; j < (int)(m); j++) {
      bool q = false;
      if (x[i][j] == '.') {
        pos[i][j].up = -1;
        pos[i][j].down = -1;
        pos[i][j].left = -1;
        pos[i][j].right = -1;
        continue;
      } else {
        for (int k = j - 1; k >= 0; k--)
          if (x[i][k] != '.') {
            pos[i][j].left = k;
            q = true;
            break;
          }
        if (!q) pos[i][j].left = -1;
        q = false;
        for (int k = j + 1; k < m; k++)
          if (x[i][k] != '.') {
            pos[i][j].right = k;
            q = true;
            break;
          }
        if (!q) pos[i][j].right = -1;
        q = false;
        for (int k = i - 1; k >= 0; k--)
          if (x[k][j] != '.') {
            pos[i][j].up = k;
            q = true;
            break;
          }
        if (!q) pos[i][j].up = -1;
        q = false;
        for (int k = i + 1; k < n; k++)
          if (x[k][j] != '.') {
            pos[i][j].down = k;
            q = true;
            break;
          }
        if (!q) pos[i][j].down = -1;
      }
    }
  for (int i = 0; i < (int)(n); i++)
    for (int j = 0; j < (int)(m); j++) {
      copy(pos.begin(), pos.end(), cpos.begin());
      an = 0;
      if (x[i][j] == '.')
        continue;
      else {
        int p = i, l = j;
        while (1) {
          an++;
          if (x[p][l] == 'L') {
            if (cpos[p][l].left != -1) {
              if (cpos[p][l].up != -1)
                cpos[cpos[p][l].up][l].down = cpos[p][l].down;
              if (cpos[p][l].down != -1)
                cpos[cpos[p][l].down][l].up = cpos[p][l].up;
              if (cpos[p][l].left != -1)
                cpos[p][cpos[p][l].left].right = cpos[p][l].right;
              if (cpos[p][l].right != -1)
                cpos[p][cpos[p][l].right].left = cpos[p][l].left;
              l = cpos[p][l].left;
            } else
              break;
          } else if (x[p][l] == 'R') {
            if (cpos[p][l].right != -1) {
              if (cpos[p][l].up != -1)
                cpos[cpos[p][l].up][l].down = cpos[p][l].down;
              if (cpos[p][l].down != -1)
                cpos[cpos[p][l].down][l].up = cpos[p][l].up;
              if (cpos[p][l].left != -1)
                cpos[p][cpos[p][l].left].right = cpos[p][l].right;
              if (cpos[p][l].right != -1)
                cpos[p][cpos[p][l].right].left = cpos[p][l].left;
              l = cpos[p][l].right;
            } else
              break;
          } else if (x[p][l] == 'U') {
            if (cpos[p][l].up != -1) {
              if (cpos[p][l].up != -1)
                cpos[cpos[p][l].up][l].down = cpos[p][l].down;
              if (cpos[p][l].down != -1)
                cpos[cpos[p][l].down][l].up = cpos[p][l].up;
              if (cpos[p][l].left != -1)
                cpos[p][cpos[p][l].left].right = cpos[p][l].right;
              if (cpos[p][l].right != -1)
                cpos[p][cpos[p][l].right].left = cpos[p][l].left;
              p = cpos[p][l].up;
            } else
              break;
          } else if (x[p][l] == 'D') {
            if (cpos[p][l].down != -1) {
              if (cpos[p][l].up != -1)
                cpos[cpos[p][l].up][l].down = cpos[p][l].down;
              if (cpos[p][l].down != -1)
                cpos[cpos[p][l].down][l].up = cpos[p][l].up;
              if (cpos[p][l].left != -1)
                cpos[p][cpos[p][l].left].right = cpos[p][l].right;
              if (cpos[p][l].right != -1)
                cpos[p][cpos[p][l].right].left = cpos[p][l].left;
              p = cpos[p][l].down;
            } else
              break;
          }
        }
        if (ans < an) {
          ans = an;
          kol = 1;
        } else if (ans == an)
          kol++;
      }
    }
  cout << ans << " " << kol;
  return 0;
}
