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;
int ri() {
  int x;
  scanf("%d", &x);
  return x;
}
long long rll() {
  long long x;
  scanf("%lld", &x);
  return x;
}
int main() {
  int n = ri(), m = ri();
  vector<string> mas(n + 1);
  for (int i = (int)(1); i <= (int)(n); i++) cin >> mas[i];
  pair<int, int> ans;
  set<int> omg;
  for (int i = (int)(1); i <= (int)(n); i++)
    for (int j = (int)(0); j <= (int)(m - 1); j++) {
      if (!omg.empty() && omg.find(i * m + j) != omg.end()) continue;
      set<int> hm;
      hm.insert((i - 1) * m + j);
      int x = i, y = j;
      int xx, yy;
      int count = 0;
      if (mas[x][y] == '.') continue;
      while (1) {
        xx = x;
        yy = y;
        if (mas[x][y] == 'R') {
          for (int k = (int)(y + 1); k <= (int)(m - 1); k++)
            if (mas[x][k] != '.' && hm.find((x - 1) * m + k) == hm.end()) {
              y = k;
              hm.insert((x - 1) * m + y);
              break;
            }
        } else if (mas[x][y] == 'L') {
          for (int k = (int)(y - 1); k >= (int)(0); k--)
            if (mas[x][k] != '.' && hm.find((x - 1) * m + k) == hm.end()) {
              y = k;
              hm.insert((x - 1) * m + y);
              break;
            }
        } else if (mas[x][y] == 'U') {
          for (int k = (int)(x - 1); k >= (int)(1); k--)
            if (mas[k][y] != '.' && hm.find((k - 1) * m + y) == hm.end()) {
              x = k;
              hm.insert((x - 1) * m + y);
              break;
            }
        } else if (mas[x][y] == 'D') {
          for (int k = (int)(x + 1); k <= (int)(n); k++)
            if (mas[k][y] != '.' && hm.find((k - 1) * m + y) == hm.end()) {
              x = k;
              hm.insert((x - 1) * m + y);
              break;
            }
        }
        count++;
        if (xx == x && yy == y) {
          if (count == ans.first)
            ans.second++;
          else if (count > ans.first) {
            ans.first = count;
            ans.second = 1;
            omg = hm;
          }
          break;
        }
      }
    }
  cout << ans.first << ' ' << ans.second;
  return 0;
}
