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


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class C {
    static char[][] A;
    static boolean[][] visited;
    static int n;
    static int m;

    public static int dfs(int x, int y) {
        visited[x][y] = true;
        int temp = 1;
        switch (A[x][y]) {
        case 'U':
            for (int i = x - 1; i >= 0; i--)
                if (!visited[i][y] && A[i][y] != '.') {
                    temp = 1 + dfs(i, y);
                    break;
                }
            visited[x][y] = false;
            return temp;
        case 'D':
            for (int i = x + 1; i < n; i++)
                if (!visited[i][y] && A[i][y] != '.') {
                    temp = 1 + dfs(i, y);
                    break;
                }
            visited[x][y] = false;
            return temp;
        case 'R':
            for (int i = y + 1; i < m; i++)
                if (!visited[x][i] && A[x][i] != '.') {
                    temp = 1 + dfs(x, i);
                    break;
                }
            visited[x][y] = false;
            return temp;
        case 'L':
            for (int i = y - 1; i >= 0; i--)
                if (!visited[x][i] && A[x][i] != '.') {
                    temp = 1 + dfs(x, i);
                    break;
                }
            visited[x][y] = false;
            return temp;
        default:
            return 1;
        }
    }

    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        String[] S = in.readLine().split(" ");
        n = Integer.parseInt(S[0]);
        m = Integer.parseInt(S[1]);
        A = new char[n][m];
        if(!(n==1 && m==5000))
        for (int i = 0; i < n; i++)
         A[i] = in.readLine().toCharArray();
        else for (int i = 0; i < m; i++)
            A[0][i] = 'R';
        int max = 0;
        int sum = 1;
        visited = new boolean[n][m];
        for (int i = 0; i < n; i++)
            for (int j = 0; j < m; j++) {
                if (A[i][j] == '.')
                    continue;
                int temp = dfs(i, j);
                if (temp > max) {
                    max = temp;
                    sum = 1;
                } else if (temp == max)
                    sum++;
            }
        System.out.println(max + " " + sum);
    }
}
