#include<bits/stdc++.h>
using namespace std;
#define fo(v,a,b) for(int v = a; v <= b; v++)
#define fr(v,a,b) for(int v = a; v >= b; v--)
#define cl(a,v) memset(a, v, sizeof(a))

const int N = 1010;

int n, m, ans; char s[N][N];
bool valid[N]; int cnt = 0;

int solve() {
    ans = 0;
    fo(c, 0, 1) {
        fo(i, 1, n - 1) {
            cnt = 0;
            fo(j, 2, m - 1) {
                if(j % 2 == c)
                    valid[++cnt] = (s[i][j - 1] == '^' &&
                    s[i + 1][j] == 'v' && s[i][j + 1] == '^');
                else
                    valid[++cnt] = (s[i + 1][j - 1] == 'v' &&
                    s[i][j] == '^' && s[i + 1][j + 1] == 'v');
            }
            int f = 0;
            fo(j, 1, cnt) {
                if(f) f--;
                else if(valid[j]) ans++, f = 2;
            }
        }
    }
    fo(c, 0, 1) {
        fo(j, 1, m - 1) {
            cnt = 0;
            fo(i, 2, n - 1) {
                if(i % 2 == c)
                    valid[++cnt] = (s[i - 1][j] == '<' &&
                    s[i][j + 1] == '>' && s[i + 1][j] == '<');
                else
                    valid[++cnt] = (s[i - 1][j + 1] == '>' &&
                    s[i][j] == '<' && s[i + 1][j + 1] == '>');
            }
            int f = 0;
            fo(i, 1, cnt) {
                if(f) f--;
                else if(valid[j]) ans++, f = 2;
            }
        }
    }
    return ans;
}

int main()
{
    while(scanf("%d%d", &n, &m) == 2) {
        fo(i, 1, n) scanf("%s", s[i] + 1);
        printf("%d\n", solve());
    }
    return 0;
}
/*
 
*/