這題非常的複雜 + 麻煩，需要用到 BFS+Hamilton Path+DP
//
// GGGGGGGGGGGGG CCCCCCCCCCCCC AAA
// GGG::::::::::::G CCC::::::::::::C A:::A
// GG:::::::::::::::G CC:::::::::::::::C A:::::A
// G:::::GGGGGGGG::::G C:::::CCCCCCCC::::C A:::::::A
// G:::::G GGGGGG C:::::C CCCCCC A:::::::::A
//G:::::G C:::::C A:::::A:::::A
//G:::::G C:::::C A:::::A A:::::A
//G:::::G GGGGGGGGGGC:::::C A:::::A A:::::A
//G:::::G G::::::::GC:::::C A:::::A A:::::A
//G:::::G GGGGG::::GC:::::C A:::::AAAAAAAAA:::::A
//G:::::G G::::GC:::::C A:::::::::::::::::::::A
// G:::::G G::::G C:::::C CCCCCC A:::::AAAAAAAAAAAAA:::::A
// G:::::GGGGGGGG::::G C:::::CCCCCCCC::::C A:::::A A:::::A
// GG:::::::::::::::G CC:::::::::::::::C A:::::A A:::::A
// GGG::::::GGG:::G CCC::::::::::::C A:::::A A:::::A
// GGGGGG GGGG CCCCCCCCCCCCCAAAAAAA AAAAAAA
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
#include <ctime>
using namespace std;
#ifdef DEBUG
#define VAR(a,b) decltype(b) a=(b)
#define debug(...) printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define gettime() end\_time=clock();printf("now running time is %.7f\\n",(float)(end\_time - start\_time)/CLOCKS\_PER\_SEC);
#else
#define VAR(a,b) \_\_typeof(b) a=(b)
#define debug(...)
#define gettime()
#endif
typedef unsigned int uint;
typedef long long int Int;
typedef unsigned long long int UInt;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 25
#define PII pair<int,int\>
#define PB push\_back
#define oo (1<<29)
#define Set\_oo 0x3f
#define FOR(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define eps 1e-6
#define X first
#define Y second
clock\_t start\_time=clock(), end\_time;
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int nx,ny;
int bx,by;
int mz\[M\]\[M\];
int bnum;
int buyx\[M\];
int buyy\[M\];
int dx\[\]={1,0,0,-1};
int dy\[\]={0,-1,1,0};
char dir\[\]="ENSW";
struct path{
int d;
char str\[205\];
};
path d\[M\]\[M\];
void go(int b,int e){
int bx=buyx\[b\],by=buyy\[b\];
int ex=buyx\[e\],ey=buyy\[e\];
char rec\[M\]\[M\]\[256\]={};
int dis\[M\]\[M\];
fill(&dis\[0\]\[0\],&dis\[M-1\]\[M-1\],oo);
queue<PII> q;
dis\[bx\]\[by\]=0;
q.push(PII(bx,by));
while(!q.empty()){
int x=q.front().X;
int y=q.front().Y;
// debug("%d %d\\n",x,y);
q.pop();
for(int i=0;i<4;i++){
int nex=x+dx\[i\];
int ney=y+dy\[i\];
if(nex>=nx||nex<0||ney>=ny||ney<0)continue;
if(mz\[nex\]\[ney\]==1)continue;
if(dis\[nex\]\[ney\]>dis\[x\]\[y\]+1){
dis\[nex\]\[ney\]=dis\[x\]\[y\]+1;
int len=strlen(rec\[x\]\[y\]);
strcpy(rec\[nex\]\[ney\],rec\[x\]\[y\]);
rec\[nex\]\[ney\]\[len\]=dir\[i\];
rec\[nex\]\[ney\]\[len+1\]=0;
q.push(PII(nex,ney));
}
}
}
d\[b\]\[e\].d=dis\[ex\]\[ey\];
// printf("%s",rec\[ex\]\[ey\]);
strcpy(d\[b\]\[e\].str,rec\[ex\]\[ey\]);
}
int dp\[1<<13\]\[20\];
int rpath\[1<<13\]\[20\];
int reach;
int dfs(int s,int now,int dep){
if(s==reach){
rpath\[s\]\[now\]=0;
return (dp\[s\]\[now\]=d\[now\]\[0\].d);
}
// debug("%d %d %d\\n",dep,s,reach);
if(dp\[s\]\[now\]!=-1)return dp\[s\]\[now\];
int minans=-1;
int index=-1;
int t;
for(int i=0;i<bnum;i++){
if(i!=now&&(!((s>>i)&1))&&d\[now\]\[i\].d!=oo){
int h;
if((h=dfs(s|(1<<i),i,dep+1))!=0)
t=d\[now\]\[i\].d+h;
if(minans==-1||t<minans||(t==minans&&strcmp(d\[now\]\[i\].str,d\[now\]\[index\].str)<0)){
minans=t;
index=i;
}
}
}
if(minans<0)minans=0;
rpath\[s\]\[now\]=index;
return (dp\[s\]\[now\]=minans);
}
void printpath(int s,int x){
int y=rpath\[s\]\[x\];
printf("%s",d\[x\]\[y\].str);
if(y==0)return;
printpath(s^(1<<y),y);
}
void solve(){
for(int i=0;i<bnum;i++){
for(int j=0;j<bnum;j++){
go(i,j);
// debug("%d %d %d %s\\n",i,j,d\[i\]\[j\].d,d\[i\]\[j\].str);
}
}
Set(dp,-1);
reach=1;
for(int i=1;i<bnum;i++){
if(d\[0\]\[i\].d<oo)reach|=(1<<i);
}
if(dfs(1,0,0)){
printpath(1,0);
Pln();
}else printf("Stay home!\\n");
}
int main() {
ios\_base::sync\_with\_stdio(0);
while(~scanf("%d%d%\*c",&ny,&nx)&&nx+ny){
bnum=1;
char str\[25\];
for(int i=0;i<ny;i++){
gets(str);
for(int j=0;j<nx;j++){
if(str\[j\]==' '||str\[j\]=='S')mz\[j\]\[i\]=0;
else if(str\[j\]=='\*'){
mz\[j\]\[i\]=2;
buyx\[bnum\]=j;
buyy\[bnum\]=i;
bnum++;
}
else mz\[j\]\[i\]=1;
if(str\[j\]=='S'){
buyx\[0\]=j;
buyy\[0\]=i;
}
}
}
solve();
}
}