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 **g;
int **lx, **rx;
int **ly, **ry;
int n, m;
template <class T>
void getarr(T ***a) {
  *a = (T **)malloc((n + 10) * sizeof(T *));
  for (int i = 0; i < n + 10; i++) {
    (*a)[i] = (T *)malloc((m + 10) * sizeof(T));
  }
}
void del(int x, int y) {
  rx[x][lx[x][y]] = rx[x][y];
  lx[x][rx[x][y]] = lx[x][y];
  ry[ly[x][y]][y] = ry[x][y];
  ly[ry[x][y]][y] = ly[x][y];
}
void init() {
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= m; j++) {
      lx[i][j] = j - 1;
      rx[i][j] = j + 1;
    }
    lx[i][0] = m;
    rx[i][m] = 0;
  }
  for (int i = 1; i <= m; i++) {
    for (int j = 0; j <= n; j++) {
      ly[j][i] = j - 1;
      ry[j][i] = j + 1;
    }
    ly[0][i] = n;
    ry[n][i] = 0;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (g[i][j] == '.') {
        del(i, j);
      }
    }
  }
}
int to[300];
int solve(int x, int y) {
  int cc = 0;
  while (x != 0 && y != 0) {
    int d = to[g[x][y]];
    cc++;
    del(x, y);
    if (d == 0) {
      x = ly[x][y];
    } else if (d == 1) {
      y = rx[x][y];
    } else if (d == 2) {
      x = ry[x][y];
    } else {
      y = lx[x][y];
    }
  }
  return cc;
}
int main() {
  to['U'] = 0;
  to['R'] = 1;
  to['D'] = 2;
  to['L'] = 3;
  scanf("%d%d", &n, &m);
  getarr(&g);
  getarr(&lx);
  getarr(&rx);
  getarr(&ly);
  getarr(&ry);
  for (int i = 1; i <= n; i++) {
    scanf("%s", g[i] + 1);
  }
  int ans1 = -1, ans2 = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (g[i][j] != '.') {
        init();
        int ret = solve(i, j);
        if (ans1 < ret) {
          ans1 = ret;
          ans2 = 1;
        } else if (ans1 == ret) {
          ans2++;
        }
      }
    }
  }
  printf("%d %d\n", ans1, ans2);
  return 0;
}
