//簽到題
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define fs first
#define sc second
int n, m, dx[4]={0,0,1,-1}, dy[4]={1,-1,0,0};
pii st, ed;
string s[110];
int fa[210000]={0};
int f(int x, int y){return x*m+y+100000;}
inline int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
inline void uni(int x, int y){
x=find(x),y=find(y);
if(x!=y)fa[x]=y;
}
bool y=0;
void finish(string s){
if(!y)cout << ":)\n";
cout << s ;
y=1;
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n >> m;
for(int i=0; i<210000; i++)fa[i]=i;
for(int i=0; i<n; i++){
cin >>s[i];
for(int j=0; j<m; j++){
if(s[i][j]=='x')ed={i,j};
else if(s[i][j]=='o')st={i,j};
else if(s[i][j]=='>')uni(f(i,j),f(i,j+1));
else if(s[i][j]=='<')uni(f(i,j),f(i,j-1));
else if(s[i][j]=='v')uni(f(i,j),f(i+1,j));
else if(s[i][j]=='^')uni(f(i,j),f(i-1,j));
}
}
if(find(f(st.fs-1,st.sc))==find(f(ed.fs,ed.sc)))finish("N ");
if(find(f(st.fs,st.sc+1))==find(f(ed.fs,ed.sc)))finish("E ");
if(find(f(st.fs,st.sc-1))==find(f(ed.fs,ed.sc)))finish("W ");
if(find(f(st.fs+1,st.sc))==find(f(ed.fs,ed.sc)))finish("S ");
if(!y)cout << ":(\n";
}
