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;
struct chip {
  char dir;
  chip *u, *r, *d, *l;
  chip(char _dir) {
    dir = _dir;
    u = r = d = l = NULL;
  }
};
int main(int argc, char* argv[]) {
  int n, m;
  cin >> n >> m;
  chip*** t;
  t = (chip***)malloc(n * sizeof(chip**));
  for (int i = 0; i < n; i++) t[i] = (chip**)malloc(m * sizeof(chip*));
  char d;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> d;
      if (d != '.') {
        t[i][j] = new chip(d);
        if (i > 0) {
          int k = i - 1;
          while ((k >= 0) && (t[k][j] == NULL)) k--;
          if (k >= 0) {
            t[k][j]->d = t[i][j];
            t[i][j]->u = t[k][j];
          }
        }
        if (j > 0) {
          int k = j - 1;
          while ((k >= 0) && (t[i][k] == NULL)) k--;
          if (k >= 0) {
            t[i][k]->r = t[i][j];
            t[i][j]->l = t[i][k];
          }
        }
      } else
        t[i][j] = NULL;
    }
  }
  int max = 0;
  int count = 0;
  vector<chip*> v;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      v.clear();
      chip* c = t[i][j];
      while (c != NULL) {
        v.push_back(c);
        chip* e;
        if (c->dir == 'U') e = c->u;
        if (c->dir == 'R') e = c->r;
        if (c->dir == 'D') e = c->d;
        if (c->dir == 'L') e = c->l;
        if (c->u != NULL) c->u->d = c->d;
        if (c->r != NULL) c->r->l = c->l;
        if (c->d != NULL) c->d->u = c->u;
        if (c->l != NULL) c->l->r = c->r;
        c = e;
      }
      if (v.size() > max) {
        max = v.size();
        count = 0;
      }
      if (v.size() == max) count++;
      for (vector<chip*>::reverse_iterator r = v.rbegin(); r < v.rend(); r++) {
        chip* e = *r;
        if (e->u != NULL) e->u->d = e;
        if (e->r != NULL) e->r->l = e;
        if (e->d != NULL) e->d->u = e;
        if (e->l != NULL) e->l->r = e;
      }
    }
  }
  cout << max << " " << count << endl;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) free(t[i][j]);
  for (int i = 0; i < n; i++) free(t[i]);
  free(t);
  return 0;
}
