#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1005;
const int mod = 99824435;
int n, m, l, r;
char a[N][N];
void solve()
{
	while (cin >> n >> m)
	{
		for (int i = 1; i <= n; i++)
		{
			for (int j = 1; j <= m; j++)
				cin >> a[i][j];
		}
		int ans = 0;
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= m; j++)
			{
				if (a[i][j] == '^')
				{
					if (a[i][j + 2] == '^' && a[i + 1][j + 1] == 'v')
					{
						a[i][j + 2] = 'X', a[i + 1][j + 1] = 'X';
						ans++;
					}
					else if (a[i + 1][j - 1] == 'v' && a[i + 1][j + 1] == 'v')
					{
						a[i][j + 2] = 'X', a[i + 1][j + 1] = 'X';
						ans++;
					}
				}
				if (a[i][j] == '<')
				{
					if (a[i - 1][j + 1] == '>' && a[i + 1][j + 1] == '>')
					{
						a[i - 1][j + 1] == 'X', a[i + 1][j + 1] == 'X';
						ans++;
					}
					else if (a[i + 2][j] == '<' && a[i + 1][j + 1] == '>')
					{
						a[i + 2][j] = 'X', a[i + 1][j + 1] = 'X';
						ans++;
					}
				}
			}
		cout << ans << "\n";
	}
}

signed main()
{
	ios::sync_with_stdio();
	cin.tie();
	cout.tie();
	int _ = 1;
	// cin >> _;
	while (_--)
	{
		solve();
	}
	return 0;
}