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 Node {
  const int d, x, y;
  Node* p[4];
  Node(int d, int x, int y) : d(d), x(x), y(y) {
    for (int i = 0; i < 4; ++i) {
      p[i] = NULL;
    }
  }
  void remove() {
    for (int i = 0; i < 4; ++i) {
      if (p[i] != NULL) {
        p[i]->p[i ^ 1] = p[i ^ 1];
      }
    }
  }
  void recover() {
    for (int i = 0; i < 4; ++i) {
      if (p[i] != NULL) {
        p[i]->p[i ^ 1] = this;
      }
    }
  }
};
const char dir[] = "UDLR";
int gao(Node* p) {
  if (p == NULL) {
    return 0;
  } else {
    Node* t = p->p[p->d];
    p->remove();
    int ret = gao(t) + 1;
    p->recover();
    return ret;
  }
}
int main() {
  int r, c;
  char ch;
  Node* p;
  scanf("%d%d", &r, &c);
  vector<vector<Node*> > a(r, vector<Node*>(c));
  for (int i = 0; i < r; ++i) {
    for (int j = 0; j < c; ++j) {
      scanf(" %c", &ch);
      if (ch != '.') {
        a[i][j] = new Node(find(dir, dir + 4, ch) - dir, i, j);
      } else {
        a[i][j] = NULL;
      }
    }
  }
  for (int i = 0; i < r; ++i) {
    p = NULL;
    for (int j = 0; j < c; ++j) {
      if (a[i][j] != NULL) {
        if (p != NULL) {
          p->p[3] = a[i][j];
        }
        a[i][j]->p[2] = p;
        p = a[i][j];
      }
    }
  }
  for (int j = 0; j < c; ++j) {
    p = NULL;
    for (int i = 0; i < r; ++i) {
      if (a[i][j] != NULL) {
        if (p != NULL) {
          p->p[1] = a[i][j];
        }
        a[i][j]->p[0] = p;
        p = a[i][j];
      }
    }
  }
  int ans = 0, cnt = 0;
  for (int i = 0; i < r; ++i) {
    for (int j = 0; j < c; ++j) {
      if (a[i][j] != NULL) {
        int tmp = gao(a[i][j]);
        if (tmp > ans) {
          ans = tmp;
          cnt = 1;
        } else if (tmp == ans) {
          ++cnt;
        }
      }
    }
  }
  printf("%d %d\n", ans, cnt);
  return 0;
}
