Problem: Ksenia has a chessboard of size n × m. Each cell of the chessboard contains one of the characters: "<", ">", "^", "v", "#". The cells that contain character "#" are blocked. We know that all chessboard cells that touch the border are blocked.

Ksenia is playing with two pawns on this chessboard. Initially, she puts the pawns on the chessboard. One cell of the chessboard can contain two pawns if and only if the cell is blocked. In other cases two pawns can not stand in one cell. The game begins when Ksenia put pawns on the board. In one move, Ksenia moves each pawn to a side adjacent cell in the direction of arrows painted on the cell on which the corresponding pawn sits (if the pawn sits on "#", it does not move). Assume that Ksenia moves pawns simultaneously (see the second test case). 

Of course, Ksenia plays for points. How can one calculate the points per game? Very simply! Let's count how many movements the first pawn made and how many movements the second pawn made, sum these two numbers — it will be the resulting score of the game. 

Ksenia wonders: what is the maximum number of points she can earn (for that, she should place the pawns optimally well early in the game). Help her and find that number. 

Input

The first line contains two integers, n and m (1 ≤ n, m ≤ 2000) — the sizes of the board. Each of the following n lines contains m characters – the board's description. Each character is one of the characters: "<", ">", "^", "v", "#".

It is guaranteed that the border cells of the table are blocked cells (with character "#").

Output

If Ksenia can get infinitely many points, print -1. Otherwise, print the maximum number of points she can get.

Examples

Input

1 1
#


Output

0


Input

3 4
####
#&gt;^{}#
####


Output

3

Input

3 4
####
#&gt;&lt;#
####


Output

-1

Input

7 5
#####
##v##
##v##
#####
##^{}##
##^{}##
#####


Output

4

Input

7 5
#####
##v##
##v##
##&lt;##
##^{}##
##^{}##
#####

Output

5

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAX_H = 2000;
const int MAX_W = 2000;
const int MAX_N = MAX_H * MAX_W;
const int dxs[] = {1, 0, -1, 0}, dys[] = {0, -1, 0, 1};
int cdmap[128];
char fs[MAX_H][MAX_W + 4];
int vids[MAX_H][MAX_W];
vector<int> nbrs[MAX_N];
int ps[MAX_N], ts[MAX_N];
int mxd0s[MAX_N], mxd1s[MAX_N];
inline int getvid(int x, int y, int &n) {
  if (vids[y][x] >= 0) return vids[y][x];
  return (vids[y][x] = n++);
}
inline void setmax(int &a, int b) {
  if (a < b) a = b;
}
int main() {
  cdmap['>'] = 0, cdmap['^'] = 1, cdmap['<'] = 2, cdmap['v'] = 3;
  int h, w;
  scanf("%d%d", &h, &w);
  for (int y = 0; y < h; y++) scanf("%s", fs[y]);
  int n = 0;
  memset(vids, -1, sizeof(vids));
  memset(ps, -1, sizeof(ps));
  for (int y = 0; y < h; y++)
    for (int x = 0; x < w; x++)
      if (fs[y][x] != '#') {
        int di = cdmap[fs[y][x]];
        int vx = x + dxs[di], vy = y + dys[di];
        int u = getvid(x, y, n);
        int v = getvid(vx, vy, n);
        nbrs[v].push_back(u);
        ps[u] = v;
      }
  int m = 0;
  queue<int> q;
  for (int u = 0; u < n; u++)
    if (ps[u] < 0) q.push(u);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    ts[m++] = u;
    int vd = mxd0s[u] + 1;
    vector<int> &nbru = nbrs[u];
    for (vector<int>::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {
      int v = *vit;
      mxd0s[v] = vd;
      q.push(v);
    }
  }
  if (m != n) {
    puts("-1");
    return 0;
  }
  for (int i = n - 1; i >= 0; i--) {
    int u = ts[i];
    int up = ps[u];
    if (up >= 0) {
      if (mxd0s[up] < mxd0s[u])
        mxd1s[up] = mxd0s[up], mxd0s[up] = mxd0s[u];
      else if (mxd0s[up] == mxd0s[u])
        setmax(mxd1s[up], (ps[up] >= 0) ? mxd0s[u] - 1 : mxd0s[u]);
      setmax(mxd1s[up], mxd1s[u]);
    }
  }
  int mxd0 = 0, mxd1 = 0;
  for (int u = 0; u < n; u++)
    if (ps[u] < 0) {
      if (mxd0 < mxd0s[u])
        mxd1 = mxd0, mxd0 = mxd0s[u];
      else if (mxd0 == mxd0s[u])
        setmax(mxd1, mxd0s[u]);
      setmax(mxd1, mxd1s[u]);
    }
  printf("%d\n", mxd0 + mxd1);
  return 0;
}