#include<bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
template<typename T,typename U> T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U> T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);}
template<class T,class S> bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S> bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}
 
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii; 
typedef vector<int> vi;
typedef vector<pii> vp;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();}
  return x*w;
}

const int N=2005;
typedef tuple<int,int,int> tii;
int n,m,deg[N][N][4],p[105],cnt;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
char s[N][N];
vector<pii> ans;

bool in(int x,int y) {
  return 1<=x&&x<=n&&1<=y&&y<=m;
}

signed main() {
  n=read(), m=read();
  p['N']=3, p['S']=1, p['E']=0, p['W']=2;
  rep(i,1,n) scanf("%s",s[i]+1);
  rep(i,1,n) rep(j,1,m) {
    rep(t,0,3) deg[i][j][t]+=in(i+dx[t],j+dy[t]);
    if(s[i][j]!='.') {
      rep(t,0,3) if(t!=p[s[i][j]]) deg[i][j][t]++;
      ++cnt;
    }
  }
  queue<tii>q;
  rep(i,1,n) rep(j,1,m) rep(t,0,3)
    if(!deg[i][j][t]) q.push(tii(i,j,t));
  while(!q.empty()) {
    auto [x,y,t]=q.front(); q.pop();
    int nx=x-dx[t], ny=y-dy[t];
    if(in(nx,ny)) {
      --deg[nx][ny][t];
      if(!deg[nx][ny][t]) q.push(tii(nx,ny,t));
    }
    if(s[x][y]!='.'&&t==p[s[x][y]]) {
      ans.eb(x-1,y-1);
      rep(t,0,3) if(t!=p[s[x][y]]) {
        --deg[x][y][t];
        if(!deg[x][y][t]) q.push(tii(x,y,t));
      }
    }
  }
  if(ans.size()!=cnt) puts("-1");
  else for(auto [x,y]:ans) printf("(%d,%d)\n",x,y);
  return 0;
}