#include <iostream>
#include <vector>
using namespace std;

typedef long long ll;
const ll mod = 1e9 + 7;

string mp[1007];

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, m;
	while (cin >> n >> m)
	{
		for (int i = 1; i <= n; i++)
		{
			cin >> mp[i];
			mp[i] = " " + mp[i];
		}
		vector<vector<bool>> st(n + 1, vector<bool>(m + 1, 0));
		long long cnt = 0;
		for (int j = 1; j <= m; j++)
		{
			for (int i = 1; i <= n; i++)
			{
				if (st[i][j]) continue;
				if (mp[i][j] == '^')
				{
					int x1 = i + 1, y1 = j - 1, x2 = i + 1, y2 = j + 1;
					if (x1 <= n && y1 >= 1 && x2 <= n && y2 <= m)
					{
						if (!st[x1][y1] && !st[x2][y2] && mp[x1][y1] == 'v' && mp[x2][y2] == 'v')
						{
							cnt++;
							st[i][j] = true, st[x1][y1] = st[x2][y2] = true;
						}
					}
				}
				else if (mp[i][j] == 'v')
				{
//					cout << i << " " << j << endl;
					int x1 = i - 1, y1 = j - 1, x2 = i - 1, y2 = j + 1;
					if (x1 >= 1 && y1 >= 1 && x2 >= 1 && y2 <= m)
					{
						if (!st[x1][y1] && !st[x2][y2] && mp[x1][y1] == '^' && mp[x2][y2] == '^')
						{
							cnt++;
							st[i][j] = true, st[x1][y1] = st[x2][y2] = true;
						}
					}
				}
			}
		}
		for (int i = 1; i <= n; i++)
		{
			for (int j = 1; j <= m; j++)
			{
				if (st[i][j]) continue;
				if (mp[i][j] == '<')
				{
					int x1 = i - 1, y1 = j + 1, x2 = i + 1, y2 = j + 1;
					if (x1 >= 1 && y1 <= m && x2 <= n && y2 <= m)
					{
						if (!st[x1][y1] && !st[x2][y2] && mp[x1][y1] == '>' && mp[x2][y2] == '>')
						{
							cnt++;
							st[i][j] = true, st[x1][y1] = st[x2][y2] = true;
						}
					}
				}
				else if (mp[j][i] == '>')
				{
					int x1 = i - 1, y1 = j - 1, x2 = i + 1, y2 = j - 1;
					if (x1 >= 1 && y1 >= 1 && x2 <= n && y2 >= 1)
					{
						if (!st[x1][y1] && !st[x2][y2] && mp[x1][y1] == '<' && mp[x2][y2] == '<')
						{
							cnt++;
							st[j][i] = true, st[x1][y1] = st[x2][y2] = true;
						}
					}
				}
			}
		}
		cout << cnt << endl;
	}
	return 0;
}