#include<iostream>
#include<string>
using namespace std;
const int N = 1e3 + 10;
int n, m;
string s[N];
bool vis[N][N];
void solve()
{
	int ans = 0;
	for (int i = 0; i < n; i ++)	cin >> s[i];
	for (int i = 0; i < n; i ++)
		for (int j = 0; j < m; j ++)
			vis[i][j] = 0;
	for (int i = 0; i < n - 1; i ++)
	{
		for (int j = 0; j < m - 2; j ++)
		{
			if (s[i][j] == '^' && s[i][j + 2] == '^' && s[i + 1][j + 1] == 'v' && !vis[i][j] && !vis[i][j + 2] && !vis[i + 1][j + 1])
			{
				vis[i][j] = vis[i][j + 2] = vis[i + 1][j + 1] = 1;
				ans ++;
			}
			else if (s[i][j + 1] == 'v' && s[i + 1][j] == 'v' && s[i + 1][j + 2] == '^' && !vis[i][j + 1] && !vis[i + 1][j + 2] && !vis[i + 1][j])
			{
				vis[i][j + 1] = vis[i + 1][j + 2] = vis[i + 1][j] = 1;
				ans ++;
			}
		}
	}
	for (int i = 0; i < n - 2; i ++)
	{
		for (int j = 0; j < m - 1; j ++)
		{
			if (s[i][j] == '>' && s[i + 2][j] == '>' && s[i + 1][j + 1] == '<' && !vis[i][j] && !vis[i + 2][j] && !vis[i + 1][j + 1])
			{
				vis[i][j] = vis[i + 2][j] = vis[i + 1][j + 1] = 1;
				ans ++;
			}
			else if (s[i + 1][j] == '<' && s[i][j + 1] == '>' && s[i + 2][j + 1] == '>' && !vis[i][j + 1] && !vis[i + 1][j] && !vis[i + 2][j + 1])
			{
				vis[i + 1][j] = vis[i][j + 1] = vis[i + 2][j + 1] = 1;
				ans ++;
			}
		}
	}
	cout << ans << '\n';
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	while (cin >> n >> m)
		solve();
	return 0;
}