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 grid[5001][5001];
int vis[5001][5001];
set<int> nonEmptyR[5001];
set<int> nonEmptyC[5001];
char line[2000];
int n, m;
void regen() {
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (grid[i][j] != '.') {
        nonEmptyC[j].insert(i);
        nonEmptyR[i].insert(j);
      }
    }
  }
}
int main(void) {
  scanf("%d %d", &n, &m);
  memset(vis, 0, sizeof vis);
  for (int i = 0; i < n; i++) {
    scanf(" %s", line);
    for (int j = 0; j < m; j++) {
      grid[i][j] = line[j];
      if (grid[i][j] != '.') {
        nonEmptyC[j].insert(i);
        nonEmptyR[i].insert(j);
      }
    }
  }
  int quant = 0;
  int val = 0;
  for (int ci = 0; ci < n; ci++) {
    for (int cj = 0; cj < m; cj++) {
      if (vis[ci][cj]) continue;
      int cansw = 0;
      if (grid[ci][cj] != '.') cansw++;
      int can = 1;
      int i = ci;
      int j = cj;
      set<int>::iterator next;
      while (can) {
        nonEmptyR[i].erase(j);
        nonEmptyC[j].erase(i);
        vis[i][j] = 1;
        if (grid[i][j] == 'U') {
          if (nonEmptyC[j].size() == 0)
            can = 0;
          else {
            next = nonEmptyC[j].lower_bound(i);
            if (next == nonEmptyC[j].begin())
              can = 0;
            else {
              next--;
              i = *next;
              cansw++;
            }
          }
        } else if (grid[i][j] == 'D') {
          next = nonEmptyC[j].upper_bound(i);
          if (next == nonEmptyC[j].end())
            can = 0;
          else {
            i = *next;
            cansw++;
          }
        } else if (grid[i][j] == 'R') {
          next = nonEmptyR[i].upper_bound(j);
          if (next == nonEmptyR[i].end())
            can = 0;
          else {
            j = *next;
            cansw++;
          }
        } else if (grid[i][j] == 'L') {
          if (nonEmptyR[i].size() == 0)
            can = 0;
          else {
            next = nonEmptyR[i].lower_bound(j);
            if (next == nonEmptyR[i].begin())
              can = 0;
            else {
              next--;
              j = *next;
              cansw++;
            }
          }
        } else if (grid[i][j] == '.')
          can = 0;
      }
      if (cansw > val) {
        val = cansw;
        quant = 1;
      } else if (cansw == val)
        quant++;
      if (grid[ci][cj] != '.') regen();
    }
  }
  cout << val << " " << quant;
  return 0;
}
