Maesters Map

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define in(X,Y) (~X&&~Y&&X<N&&Y<M)
#define DR(C) (C=='v'?0:C=='^'?1:C=='>'?2:3)
char s[128][128];
int N,M,sx[]={1,-1,0,0},sy[]={0,0,1,-1},cn[128][128];
bool dfs(int x,int y,int w){
    if(!in(x,y)||cn[x][y]++)return 0;
    if(s[x][y]==42)return 1;
    if(s[x][y]^46)w=DR(s[x][y]);
    if(!~w)return 0;
    return dfs(x+sx[w],y+sy[w],w);
}
int main(void){
    scanf("%d%d",&M,&N);
    F(N)scanf("%s",s[i]);
    puts(dfs(0,0,-1)?"*":"!");
    return 0;
}