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;
int main() {
  long long maxi = 0;
  long long res = 1;
  long long n, m;
  cin >> n >> m;
  vector<string> mp(n);
  for (long long i = 0; i < ((long long)n); i++) cin >> mp[i];
  long long all = n * m;
  for (long long start = 0; start < ((long long)all); start++)
    if (mp[(start / m)][(start % m)] != '.') {
      vector<int> up(all), down(all), left(all), right(all);
      for (long long i = 0; i < ((long long)all); i++) up[i] = max(-1ll, i - m);
      for (long long i = 0; i < ((long long)all); i++)
        down[i] = (all <= i + m) ? -1 : (i + m);
      for (long long i = 0; i < ((long long)all); i++)
        left[i] = ((i % m) == 0) ? -1 : (i - 1);
      for (long long i = 0; i < ((long long)all); i++)
        right[i] = ((i % m) + 1 == m) ? -1 : (i + 1);
      long long pos = start, cnt = 0, dir = -1;
      while (pos != -1) {
        char c = mp[(pos / m)][(pos % m)];
        string direction = "DRUL";
        for (long long i = 0; i < ((long long)((long long)direction.size()));
             i++)
          if (c == direction[i]) cnt++, dir = i;
        if (up[pos] != -1) down[up[pos]] = down[pos];
        if (down[pos] != -1) up[down[pos]] = up[pos];
        if (left[pos] != -1) right[left[pos]] = right[pos];
        if (right[pos] != -1) left[right[pos]] = left[pos];
        if (dir == 0) pos = down[pos];
        if (dir == 1) pos = right[pos];
        if (dir == 2) pos = up[pos];
        if (dir == 3) pos = left[pos];
      }
      if (maxi == cnt) {
        res++;
        cout << "boo" << endl;
      }
      if (maxi < cnt) {
        maxi = cnt;
        res = 1;
      }
    }
  cout << maxi << " " << res << endl;
}
