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 n, m;
const int MAXN = 5000;
char grid[MAXN + 10][MAXN + 10];
char c[MAXN + 10][MAXN + 10];
int vis[MAXN + 10];
int cnt;
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
void init() {
  memset(grid, 0, sizeof(grid));
  for (int i = 0; i < n; i++) {
    scanf("%s", grid[i]);
  }
  memset(vis, 0, sizeof(vis));
}
void initc() {
  for (int i = 0; i < n; i++) {
    strcpy(c[i], grid[i]);
  }
  cnt = 0;
}
void find(int ix, int iy) {
  while (ix >= 0 && ix < n && iy >= 0 && iy < m && c[ix][iy] != '.') {
    if (c[ix][iy] == 'U') {
      c[ix][iy] = '.';
      cnt++;
      do {
        ix += dx[0];
        iy += dy[0];
        if (ix < 0 || iy < 0 || ix >= n || iy >= m) return;
      } while (c[ix][iy] == '.');
    }
    if (c[ix][iy] == 'D') {
      c[ix][iy] = '.';
      cnt++;
      do {
        ix += dx[1];
        iy += dy[1];
        if (ix < 0 || iy < 0 || ix >= n || iy >= m) return;
      } while (c[ix][iy] == '.');
    }
    if (c[ix][iy] == 'L') {
      c[ix][iy] = '.';
      cnt++;
      do {
        ix += dx[2];
        iy += dy[2];
        if (ix < 0 || iy < 0 || ix >= n || iy >= m) return;
      } while (c[ix][iy] == '.');
    }
    if (c[ix][iy] == 'R') {
      c[ix][iy] = '.';
      cnt++;
      do {
        ix += dx[3];
        iy += dy[3];
        if (ix < 0 || iy < 0 || ix >= n || iy >= m) return;
      } while (c[ix][iy] == '.');
    }
  }
}
void fun() {
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      initc();
      find(i, j);
      vis[cnt]++;
    }
  }
  for (int i = n * m; i > 0; i--) {
    if (vis[i] > 0) {
      printf("%d %d\n", i, vis[i]);
      return;
    }
  }
}
int main() {
  freopen("a.in", "r", stdin);
  while (~scanf("%d%d", &n, &m)) {
    init();
    fun();
  }
}
