// Telebe of adicto yani AzeTurk810
/*
Author: AzeTurk810
Licance: open source(only authors name must be in code)
Begin Time:11/20/2024 20:48
Problem link: https://codeforces.com/problemset/problem/1543/D1
*/
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
bool check(std::string s)
{
std::string sc = s;
reverse(sc.begin(),sc.end());
return sc == s;
}
signed main()
{
std::ios_base::sync_with_stdio(false);std::cin.tie(0);std::cout.tie(0);
int n, m;
cin >> n >> m;
char a[n][m];
int x=0, y=0;
for (int i=0; i < n; i++) {
for (int j=0; j < m ;j++) {
cin >> a[i][j];
if (a[i][j] =='F')x = 1;
if (a[i][j] == 'R') y = 1;
}
}
cout << x + y;
}
