#include<iostream>
#include<string.h>
#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<vector>
using namespace std;
const int N=1010;
int n,m;
char c[N][N];
bool bi[N][N];//标记当前位置有没有被用过
int cnt;
signed main()
{
	while(cin>>n>>m)
	{
		cnt=0;
		memset(bi,0,sizeof bi);
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<m;j++)
			{
				cin>>c[i][j];
			}
		}
		
		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++)
			{
				if(!bi[i][j])
				{
					if(c[i][j]=='^')
					{
						if((i+1)<n&&(j-1)>=0&&(j+1)<m&&c[i+1][j-1]=='v'&&c[i+1][j+1]=='v'&&!bi[i+1][j-1]&&!bi[i+1][j+1])
						{
							cnt++;
							bi[i+1][j-1]=1;
							bi[i+1][j+1]=1;
							bi[i][j]=1;
						}

						else if((i+1)<n&&(j+2)<m&&c[i][j+2]=='^'&&c[i+1][j+1]=='v'&&!bi[i][j+2]&&!bi[i+1][j+1])
						{
							bi[i][j+2]=1;
							bi[i+1][j+1]=1;
							bi[i][j]=1;
							cnt++;
						}
					}
					else if(c[i][j]=='>'){
						if((i-1)>=0&&(j-1)>=0&&(i+1)<n&&c[i-1][j-1]=='<'&&c[i+1][j-1]=='<'&&!bi[i-1][j-1]&&!bi[i+1][j-1]){
							bi[i][j]=1;
							bi[i-1][j-1]=1;
							bi[i+1][j-1]=1;
							cnt++;
						}
					}
					else if(c[i][j]=='<')
					{
						if((i-1)>=0&&(i+1)<n&&(j+1)<m&&c[i-1][j+1]=='>'&&c[i+1][j+1]=='>'&&!bi[i-1][j+1]&&!bi[i+1][j+1])
						{
							bi[i][j]=1;
							bi[i-1][j+1]=1;
							bi[i+1][j+1]=1;
							cnt++;
						}
					}
				}
			}
		}
		
		cout<<cnt<<endl;
	}
	return 0;
}