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 coin {
  int dir;
  coin *nx[4];
  coin() { memset(nx, 0, sizeof nx); }
};
int n, m;
vector<vector<coin> > cs;
int di[] = {-1, 0, 1, 0};
int dj[] = {0, 1, 0, -1};
string dirs = "URDL";
void remove_coin(coin *c) {
  for (int k = 0; k < int(4); ++k)
    if (c->nx[(k + 2) % 4]) c->nx[(k + 2) % 4]->nx[k] = c->nx[k];
}
void make_net() {
  for (int i = 0; i < int(n); ++i)
    for (int j = 0; j < int(m); ++j)
      for (int k = 0; k < int(4); ++k) {
        int ni = i + di[k], nj = j + dj[k];
        if (0 <= ni && ni < n && 0 <= nj && nj < m)
          cs[i][j].nx[k] = &cs[ni][nj];
        else
          cs[i][j].nx[k] = 0;
      }
  for (int i = 0; i < int(n); ++i)
    for (int j = 0; j < int(m); ++j)
      if (cs[i][j].dir == int(string::npos)) remove_coin(&cs[i][j]);
}
int solve(int i, int j) {
  int count = 1;
  make_net();
  for (coin *c = &cs[i][j]; c->nx[c->dir]; c = c->nx[c->dir]) {
    remove_coin(c);
    ++count;
  }
  return count;
}
int main() {
  cin >> n >> m;
  cs.resize(n, vector<coin>(m));
  for (int i = 0; i < int(n); ++i)
    for (int j = 0; j < int(m); ++j) {
      char tmp;
      cin >> tmp;
      cs[i][j].dir = dirs.find(tmp);
    }
  int opt = -1, optc = 0;
  for (int i = 0; i < int(n); ++i)
    for (int j = 0; j < int(m); ++j)
      if (cs[i][j].dir != int(string::npos)) {
        int pts = solve(i, j);
        if (opt < pts)
          opt = pts, optc = 1;
        else if (opt == pts)
          ++optc;
      }
  cout << opt << ' ' << optc << endl;
}
