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;
const long double EPS = 1e-11;
struct point {
  int x, y;
  char c;
};
char a[5000][5000];
int res[5000][5000];
int n, m;
void check(int x, int y) {
  vector<point> track;
  point tmp;
  int num = 0;
  int flag = 1;
  while (flag) {
    flag = 0;
    if (a[x][y] == 'L') {
      for (int j = y - 1; j >= 0; j--) {
        if (a[x][j] != '.') {
          tmp.c = a[x][y];
          tmp.x = x;
          tmp.y = y;
          a[x][y] = '.';
          flag = 1;
          x = x;
          y = j;
          track.push_back(tmp);
          num++;
          break;
        }
      }
    } else if (a[x][y] == 'R') {
      for (int j = y + 1; j < m; j++) {
        if (a[x][j] != '.') {
          tmp.c = a[x][y];
          tmp.x = x;
          tmp.y = y;
          a[x][y] = '.';
          flag = 1;
          x = x;
          y = j;
          track.push_back(tmp);
          num++;
          break;
        }
      }
    } else if (a[x][y] == 'U') {
      for (int i = x - 1; i >= 0; i--) {
        if (a[i][y] != '.') {
          tmp.c = a[x][y];
          tmp.x = x;
          tmp.y = y;
          a[x][y] = '.';
          flag = 1;
          x = i;
          y = y;
          track.push_back(tmp);
          num++;
          break;
        }
      }
    } else if (a[x][y] == 'D') {
      for (int i = x + 1; i < n; i++) {
        if (a[i][y] != '.') {
          tmp.c = a[x][y];
          tmp.x = x;
          tmp.y = y;
          a[x][y] = '.';
          flag = 1;
          x = i;
          y = y;
          track.push_back(tmp);
          num++;
          break;
        }
      }
    }
  }
  num++;
  for (int i = 0; i < track.size(); i++) {
    a[track[i].x][track[i].y] = track[i].c;
    res[track[i].x][track[i].y] = num - i;
  }
}
int main() {
  cin >> n >> m;
  int ans = 0, move = 0;
  memset(res, -1, sizeof(res));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> a[i][j];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (a[i][j] != '.') {
        if (res[i][j] == -1) check(i, j);
      }
    }
  }
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      if (res[i][j] > ans) ans = res[i][j];
    }
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      if (res[i][j] == ans) move++;
    }
  cout << ans << " " << move << endl;
  return 0;
}
