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 **mas, **test;
int n, m;
void clear_test(int ***test) {
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      (*test)[i][j] = 0;
    }
  }
  return;
};
int answer(int I, int J) {
  test[I][J] = 1;
  switch (mas[I][J]) {
    case 0:
      for (int i = I + 1; i < n; i++) {
        if (!test[i][J] && mas[i][J] != -1) {
          return 1 + answer(i, J);
        }
      }
      break;
    case 1:
      for (int i = I - 1; i >= 0; i--) {
        if (!test[i][J] && mas[i][J] != -1) {
          return 1 + answer(i, J);
        }
      }
      break;
    case 2:
      for (int j = J - 1; j >= 0; j--) {
        if (!test[I][j] && mas[I][j] != -1) {
          return 1 + answer(I, j);
        }
      }
      break;
    case 3:
      for (int j = J + 1; j < m; j++) {
        if (!test[I][j] && mas[I][j] != -1) {
          return 1 + answer(I, j);
        }
      }
      break;
    default:;
  }
  return 1;
};
int main() {
  scanf("%d %d", &n, &m);
  mas = (int **)calloc(n, sizeof(int *));
  test = (int **)calloc(n, sizeof(int *));
  for (int i = 0; i < n; i++) {
    mas[i] = (int *)calloc(m, sizeof(int));
    test[i] = (int *)calloc(m, sizeof(int));
  }
  clear_test(&test);
  for (int i = 0; i < n; i++) {
    char *str = new char[m + 5];
    scanf("%s", str);
    int len = strlen(str);
    for (int j = 0; j < len; j++) {
      switch (str[j]) {
        case 'D':
          mas[i][j] = 0;
          break;
        case 'U':
          mas[i][j] = 1;
          break;
        case 'L':
          mas[i][j] = 2;
          break;
        case 'R':
          mas[i][j] = 3;
          break;
        case '.':
          mas[i][j] = -1;
          break;
        default:;
      }
    }
    delete[] str;
  }
  int max = 0;
  int max_count = 1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      clear_test(&test);
      int temp = answer(i, j);
      if (temp > max) {
        max_count = 1;
        max = temp;
      } else {
        if (temp == max) {
          max_count++;
        }
      }
    }
  }
  printf("%d %d\n", max, max_count);
  return 0;
}
