#include <iostream>
#include <string>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#define buff ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;

int n, m;

int main()
{
	buff;
	while(cin >> n >> m)
	{
		vector<vector<bool> > vis(n, vector<bool>(m, 0));
		vector<vector<bool> > vis2(n, vector<bool>(m, 0));
		vector<string> vc(n);
		for(int i = 0; i < n; i++)
		{
			cin >> vc[i];
		}
		int ans1 = 0, ans2 = 0;
		for(int i = 0; i < n; i++)
		{
			for(int j = 0; j < m; j++)
			{
				if(vis[i][j])
					continue;
				if(vc[i][j] == '^')
				{
					if(j + 2 < m && i + 1 < n && !vis[i][j + 2] && !vis[i + 1][j + 1] && (vc[i][j + 2] == '^') && (vc[i + 1][j + 1] == 'v'))
					{
						vis[i][j] = vis[i][j + 2] = vis[i + 1][j + 1] = 1;
						ans1++;
					}
					else if(j - 1 >= 0 && j + 1 < m && i + 1 < n && !vis[i + 1][j - 1] && !vis[i + 1][j + 1] && (vc[i + 1][j - 1] == 'v') && (vc[i + 1][j + 1] == 'v'))
					{
						vis[i][j] = vis[i + 1][j - 1] = vis[i + 1][j + 1] = 1;
						ans1++;
					}
				}
				else if(vc[i][j] == '<')
				{
					if(j + 1 < m && i + 2 < n && !vis[i + 2][j] && !vis[i + 1][j + 1] && (vc[i + 2][j] == '<') && (vc[i + 1][j + 1] == '>'))
					{
						vis[i][j] = vis[i + 2][j] = vis[i + 1][j + 1] = 1;
						ans1++;
					}
					else if(j + 1 < m && i - 1 >= 0 && i + 1 < n && !vis[i + 1][j + 1] && !vis[i - 1][j + 1] && (vc[i + 1][j + 1] == '>') && (vc[i - 1][j + 1] == '>'))
					{
						vis[i][j] = vis[i - 1][j + 1] = vis[i + 1][j + 1] = 1;
						ans1++;
					}
				}
			}
		}
		cout << max(ans1, ans2) << '\n';
	}
	return 0;
}