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.*;
import java.util.*;



public class E {
	String line = null;

	public void run() throws Exception{

		BufferedReader br = null;
		File file = new File("input.txt");
		if(file.exists()){
			br = new BufferedReader(new FileReader("input.txt"));
		}
		else{
			br = new BufferedReader(new InputStreamReader(System.in));
		}
		line = br.readLine();
		String[] lines = line.split(" ");
		int n = Integer.parseInt(lines[0]);
		int m = Integer.parseInt(lines[1]);
		
		char[][] data = new char[n][m];
		boolean[][] flag = new boolean[n][m];
		int ans = 0;
		int num = 0;
		
		int t = n;
		for(int j = 0; j < n; j++){
			line = br.readLine();
			for(int i = 0; i < m; i++){
				data[j][i] = line.charAt(i);
				if(data[j][i] == '.'){
					flag[j][i] = true;
				}
			}
		}
		
		for(int i = 0; i < n; i++){
			for(int j = 0; j < m; j++){
				if(flag[i][j]){
					continue;
				}
				int[][] cnt = new int[n][m];
				int x = j;
				int y = i;
				int c = 0;
				while(true){
					int X = 0;
					int Y = 0;
					if(data[y][x] == 'R'){
						X = 1;
					}
					else if(data[y][x] == 'L'){
						X = -1;
					}
					else if(data[y][x] == 'U'){
						Y = -1;
					}
					else if(data[y][x] == 'D'){
						Y = 1;
					}
					
					boolean found = false;
					cnt[y][x]++;
					c++;
					while(true){
						x = x + X;
						y = y + Y;
						if(x < 0 || x >= m || y < 0 || y >= n){
							break;
						}
						else if(cnt[y][x] == 0 && data[y][x] != '.'){
							break;
						}
						else{
							cnt[y][x]++;
						}
					}
					if(x < 0 || x >= m || y < 0 || y >= n){
						break;
					}
				}
				if(c > ans){
					ans = c;
					num = 1;
				}
				else if(c == ans){
					num++;
				}
				for(int k = 0; k < n; k++){
					for(int l = 0; l < m; l++){
						if(cnt[k][l] == 1){
							flag[k][l] = true;
						}
					}
				}
				
			}
		}
		System.out.println(ans + " " + num);
	}
	
	
	
	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception{
		E t = new E();
		t.run();

	}

}
