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;
char a[5001][5001], s[5001][5001];
int ma[5001][5001];
int sum, js;
void fz(int n, int m) {
  int i = 1;
  for (; i <= n; i++) {
    int j = 1;
    for (; j <= m; j++) {
      s[i][j] = a[i][j - 1];
    }
  }
}
int cz(int i, int j, char c) {
  if (s[i][j] == '0')
    return 0;
  else {
    if (s[i][j] == 'U') {
      sum++;
      s[i][j] = '.';
      ma[i][j] = 1;
      return cz(i - 1, j, 'U');
    } else {
      if (s[i][j] == 'D') {
        sum++;
        s[i][j] = '.';
        ma[i][j] = 1;
        return cz(i + 1, j, 'D');
      } else if (s[i][j] == 'L') {
        sum++;
        s[i][j] = '.';
        ma[i][j] = 1;
        return cz(i, j - 1, 'L');
      } else if (s[i][j] == 'R') {
        sum++;
        s[i][j] = '.';
        ma[i][j] = 1;
        return cz(i, j + 1, 'R');
      } else {
        if (c == 'U')
          return cz(i - 1, j, 'U');
        else if (c == 'D')
          return cz(i + 1, j, 'D');
        else if (c == 'L')
          return cz(i, j - 1, 'L');
        else
          return cz(i, j + 1, 'R');
      }
    }
  }
}
int main() {
  int n, m;
  while (cin >> n >> m) {
    js = 1;
    int max = 0;
    memset(s, '0', sizeof(s));
    memset(a, 0, sizeof(a));
    int i = 1;
    for (; i <= n; i++) {
      scanf("%s", &a[i]);
    }
    for (i = 1; i <= n; i++) {
      int j = 1;
      for (; j <= m; j++) {
        fz(n, m);
        if (s[i][j] == '.')
          continue;
        else if (ma[i][j] == 1)
          continue;
        else {
          sum = 0;
          cz(i, j, s[i][j]);
          if (sum > max) {
            js = 1;
            max = sum;
          } else {
            if (sum == max) js++;
          }
        }
      }
    }
    cout << max << ' ' << js << endl;
  }
  return 0;
}
